{"file_path":"src/CollateralRegistry.sol","creation_status":"success","source_code":"// SPDX-License-Identifier: BUSL-1.1\n\npragma solidity 0.8.24;\n\nimport \"openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol\";\n\nimport \"./Interfaces/ITroveManager.sol\";\nimport \"./Interfaces/IBoldToken.sol\";\nimport \"./Interfaces/IAddressesRegistry.sol\";\nimport \"./Interfaces/IActivePool.sol\";\nimport \"./Dependencies/Constants.sol\";\nimport \"./Dependencies/LiquityMath.sol\";\n\nimport \"./Interfaces/ICollateralRegistry.sol\";\nimport \"./Interfaces/IAeroManager.sol\";\n\ncontract CollateralRegistry is ICollateralRegistry {\n // See: https://github.com/ethereum/solidity/issues/12587\n uint256 public totalCollaterals;\n\n uint256 private constant MAX_REDEEMABLE_BRANCHES = 10;\n\n //standard, redeemable branches are capped at 10 total\n IERC20Metadata[] internal redeemableBranchesTokens;\n ITroveManager[] internal redeemableBranchesTroveManagers;\n\n //special, non-redeemable branches\n IERC20Metadata[] internal nonRedeemableBranchesTokens;\n ITroveManager[] internal nonRedeemableBranchesTroveManagers;\n\n IAeroManager public aeroManager;\n\n IBoldToken public immutable boldToken;\n\n /// @dev Set to true when any branch added via `createNewBranch` uses Aero LP collateral\n bool public hasAeroLPCollateralBranch;\n\n uint256 public baseRate;\n\n address public collateralGovernor;\n address public governor;\n\n address public pendingGovernor;\n uint256 public pendingGovernorTimestamp;\n\n // The timestamp of the latest fee operation (redemption or new Bold issuance)\n uint256 public lastFeeOperationTime = block.timestamp;\n\n event BaseRateUpdated(uint256 _baseRate);\n event LastFeeOpTimeUpdated(uint256 _lastFeeOpTime);\n event CollateralBranchAdded(uint256 _totalCollaterals, uint256 _index, IERC20Metadata _token, ITroveManager _troveManager, bool _isRedeemable);\n event CollateralGovernorUpdated(address oldGovernor, address newGovernor);\n event GovernorProposed(address indexed pendingGovernor, uint256 activateAtTimestamp);\n event GovernorProposalCancelled(address indexed cancelledGovernor);\n event GovernorUpdated(address oldGovernor, address newGovernor);\n event AeroManagerUpdated(address oldAeroManager, address newAeroManager);\n\n /// @dev The constructor assumes only redeemable branches\n /// @param _boldToken The address of the bold token\n /// @param _tokens The collateral tokens of initial redeemable branches\n /// @param _troveManagers The trove managers of initial redeemable branches\n /// @param _aeroManager The aero manager\n /// @param _governor The address of the governor\n constructor(IBoldToken _boldToken, IERC20Metadata[] memory _tokens, ITroveManager[] memory _troveManagers, IAeroManager _aeroManager, address _governor) {\n uint256 numTokens = _tokens.length;\n require(numTokens > 0, \"Collateral list cannot be empty\");\n require(numTokens <= MAX_REDEEMABLE_BRANCHES, \"Collateral list too long\");\n totalCollaterals = numTokens;\n\n boldToken = _boldToken;\n aeroManager = _aeroManager;\n\n require(_tokens.length == _troveManagers.length, \"Tokens and trove managers must have the same length\");\n //standard, redeemable branches\n for(uint256 i = 0; i < _tokens.length; i++){\n redeemableBranchesTokens.push(_tokens[i]);\n redeemableBranchesTroveManagers.push(_troveManagers[i]);\n }\n\n collateralGovernor = _governor;\n governor = _governor;\n\n // Initialize the baseRate state variable\n baseRate = INITIAL_BASE_RATE;\n emit BaseRateUpdated(INITIAL_BASE_RATE);\n }\n \n /// @notice Creates a new branch for the collateral registry\n /// @dev If the new branch is redeemable, it will be added to the redeemable branches array, but only 10 are allowed\n /// Also, make sure that it doesn't already exist. Do not add a new branch using an existing known trove manager. Governor is expected to be trusted on this.\n /// @param _addressesRegistry The addresses registry for the new branch\n /// @param _isRedeemable Whether the new branch is redeemable\n function createNewBranch(IAddressesRegistry _addressesRegistry, bool _isRedeemable) external {\n require(msg.sender == collateralGovernor, \"CR: Only collateral governor can create new branches\");\n\n IERC20Metadata _token = _addressesRegistry.collToken();\n ITroveManager _troveManager = _addressesRegistry.troveManager();\n address _stabilityPool = address(_addressesRegistry.stabilityPool());\n address _borrowerOperations = address(_addressesRegistry.borrowerOperations());\n IActivePool _activePool = _addressesRegistry.activePool();\n\n require(address(_token) != address(0), \"CR: Token cannot be the zero address\");\n require(address(_troveManager) != address(0), \"CR: Trove manager cannot be the zero address\");\n require(address(_token) != address(boldToken), \"CR: Token cannot be the bold token\");\n require(_stabilityPool != address(0), \"CR: Stability pool cannot be the zero address\");\n require(_borrowerOperations != address(0), \"CR: Borrower operations cannot be the zero address\");\n require(address(_activePool) != address(0), \"CR: Active pool cannot be the zero address\");\n require(address(_activePool) == address(_troveManager.activePool()), \"CR: Active pool does not match trove manager\");\n \n bool _isAeroLPCollateral = _activePool.isAeroLPCollateral();\n if (_isAeroLPCollateral) {\n require(\n address(aeroManager) == address(_addressesRegistry.aeroManager())\n && _activePool.aeroManagerAddress() == address(aeroManager), \n \"CR: AeroManager address mismatch\"\n );\n }\n\n uint256 index;\n if(_isRedeemable){\n require(redeemableBranchesTokens.length < MAX_REDEEMABLE_BRANCHES, \"CR: Max 10 redeemable branches\");\n index = redeemableBranchesTokens.length;\n redeemableBranchesTokens.push(_token);\n redeemableBranchesTroveManagers.push(_troveManager);\n } else {\n index = nonRedeemableBranchesTokens.length;\n nonRedeemableBranchesTokens.push(_token);\n nonRedeemableBranchesTroveManagers.push(_troveManager);\n }\n \n // Add branch addresses in bold token\n boldToken.setBranchAddressesViaCollateralRegistry(\n address(_troveManager), \n _stabilityPool, \n _borrowerOperations, \n address(_activePool)\n );\n \n totalCollaterals++;\n emit CollateralBranchAdded(totalCollaterals, index, _token, _troveManager, _isRedeemable);\n\n // If AERO LP collateral, add to AeroManager\n if (_isAeroLPCollateral) {\n hasAeroLPCollateralBranch = true;\n aeroManager.addActivePool(address(_activePool));\n }\n }\n\n struct RedemptionTotals {\n uint256 numCollaterals;\n uint256 boldSupplyAtStart;\n uint256 unbacked;\n uint256 redeemedAmount;\n }\n\n function redeemCollateral(uint256 _boldAmount, uint256 _maxIterationsPerCollateral, uint256 _maxFeePercentage)\n external\n {\n _requireValidMaxFeePercentage(_maxFeePercentage);\n _requireAmountGreaterThanZero(_boldAmount);\n\n RedemptionTotals memory totals;\n\n totals.numCollaterals = redeemableBranchesTokens.length;\n uint256[] memory unbackedPortions = new uint256[](totals.numCollaterals);\n uint256[] memory prices = new uint256[](totals.numCollaterals);\n\n // Gather and accumulate unbacked portions\n for (uint256 index = 0; index < totals.numCollaterals; index++) {\n ITroveManager troveManager = getTroveManager(index);\n (uint256 unbackedPortion, uint256 price, bool redeemable) =\n troveManager.getUnbackedPortionPriceAndRedeemability();\n prices[index] = price;\n if (redeemable) {\n totals.unbacked += unbackedPortion;\n unbackedPortions[index] = unbackedPortion;\n }\n }\n\n // There’s an unlikely scenario where all the normally redeemable branches (i.e. having TCR > SCR) have 0 unbacked\n // In that case, we redeem proportionally to branch size\n if (totals.unbacked == 0) {\n unbackedPortions = new uint256[](totals.numCollaterals);\n for (uint256 index = 0; index < totals.numCollaterals; index++) {\n ITroveManager troveManager = getTroveManager(index);\n (,, bool redeemable) = troveManager.getUnbackedPortionPriceAndRedeemability();\n if (redeemable) {\n uint256 unbackedPortion = troveManager.getEntireBranchDebt();\n totals.unbacked += unbackedPortion;\n unbackedPortions[index] = unbackedPortion;\n }\n }\n } else {\n // Don't allow redeeming more than the total unbacked in one go, as that would result in a disproportionate\n // redemption (see CS-BOLD-013). Instead, truncate the redemption to total unbacked. If this happens, the\n // redeemer can call `redeemCollateral()` a second time to redeem the remainder of their BOLD.\n if (_boldAmount > totals.unbacked) {\n _boldAmount = totals.unbacked;\n }\n }\n\n totals.boldSupplyAtStart = boldToken.totalSupply();\n // Decay the baseRate due to time passed, and then increase it according to the size of this redemption.\n // Use the saved total Bold supply value, from before it was reduced by the redemption.\n // We only compute it here, and update it at the end,\n // because the final redeemed amount may be less than the requested amount\n // Redeemers should take this into account in order to request the optimal amount to not overpay\n uint256 redemptionRate =\n _calcRedemptionRate(_getUpdatedBaseRateFromRedemption(_boldAmount, totals.boldSupplyAtStart));\n require(redemptionRate <= _maxFeePercentage, \"CR: Fee exceeded provided maximum\");\n // Implicit by the above and the _requireValidMaxFeePercentage checks\n //require(newBaseRate < DECIMAL_PRECISION, \"CR: Fee would eat up all collateral\");\n\n // Compute redemption amount for each collateral and redeem against the corresponding TroveManager\n for (uint256 index = 0; index < totals.numCollaterals; index++) {\n //uint256 unbackedPortion = unbackedPortions[index];\n if (unbackedPortions[index] > 0) {\n uint256 redeemAmount = _boldAmount * unbackedPortions[index] / totals.unbacked;\n if (redeemAmount > 0) {\n ITroveManager troveManager = getTroveManager(index);\n uint256 redeemedAmount = troveManager.redeemCollateral(\n msg.sender, redeemAmount, prices[index], redemptionRate, _maxIterationsPerCollateral\n );\n totals.redeemedAmount += redeemedAmount;\n }\n\n // Ensure that per-branch redeems add up to `_boldAmount` exactly\n _boldAmount -= redeemAmount;\n totals.unbacked -= unbackedPortions[index];\n }\n }\n\n _updateBaseRateAndGetRedemptionRate(totals.redeemedAmount, totals.boldSupplyAtStart);\n\n // Burn the total Bold that is cancelled with debt\n if (totals.redeemedAmount > 0) {\n boldToken.burn(msg.sender, totals.redeemedAmount);\n }\n }\n\n // --- Internal fee functions ---\n\n // Update the last fee operation time only if time passed >= decay interval. This prevents base rate griefing.\n function _updateLastFeeOpTime() internal {\n uint256 minutesPassed = _minutesPassedSinceLastFeeOp();\n\n if (minutesPassed > 0) {\n lastFeeOperationTime += ONE_MINUTE * minutesPassed;\n emit LastFeeOpTimeUpdated(lastFeeOperationTime);\n }\n }\n\n function _minutesPassedSinceLastFeeOp() internal view returns (uint256) {\n return (block.timestamp - lastFeeOperationTime) / ONE_MINUTE;\n }\n\n // Updates the `baseRate` state with math from `_getUpdatedBaseRateFromRedemption`\n function _updateBaseRateAndGetRedemptionRate(uint256 _boldAmount, uint256 _totalBoldSupplyAtStart) internal {\n uint256 newBaseRate = _getUpdatedBaseRateFromRedemption(_boldAmount, _totalBoldSupplyAtStart);\n\n //assert(newBaseRate <= DECIMAL_PRECISION); // This is already enforced in `_getUpdatedBaseRateFromRedemption`\n\n // Update the baseRate state variable\n baseRate = newBaseRate;\n emit BaseRateUpdated(newBaseRate);\n\n _updateLastFeeOpTime();\n }\n\n /*\n * This function calculates the new baseRate in the following way:\n * 1) decays the baseRate based on time passed since last redemption or Bold borrowing operation.\n * then,\n * 2) increases the baseRate based on the amount redeemed, as a proportion of total supply\n */\n function _getUpdatedBaseRateFromRedemption(uint256 _redeemAmount, uint256 _totalBoldSupply)\n internal\n view\n returns (uint256)\n {\n // decay the base rate\n uint256 decayedBaseRate = _calcDecayedBaseRate();\n\n // get the fraction of total supply that was redeemed\n uint256 redeemedBoldFraction = _redeemAmount * DECIMAL_PRECISION / _totalBoldSupply;\n\n uint256 newBaseRate = decayedBaseRate + redeemedBoldFraction / REDEMPTION_BETA;\n newBaseRate = LiquityMath._min(newBaseRate, DECIMAL_PRECISION); // cap baseRate at a maximum of 100%\n\n return newBaseRate;\n }\n\n function _calcDecayedBaseRate() internal view returns (uint256) {\n uint256 minutesPassed = _minutesPassedSinceLastFeeOp();\n uint256 decayFactor = LiquityMath._decPow(REDEMPTION_MINUTE_DECAY_FACTOR, minutesPassed);\n\n return baseRate * decayFactor / DECIMAL_PRECISION;\n }\n\n function _calcRedemptionRate(uint256 _baseRate) internal pure returns (uint256) {\n return LiquityMath._min(\n REDEMPTION_FEE_FLOOR + _baseRate,\n DECIMAL_PRECISION // cap at a maximum of 100%\n );\n }\n\n function _calcRedemptionFee(uint256 _redemptionRate, uint256 _amount) internal pure returns (uint256) {\n uint256 redemptionFee = _redemptionRate * _amount / DECIMAL_PRECISION;\n return redemptionFee;\n }\n\n // external redemption rate/fee getters\n\n function getRedemptionRate() external view override returns (uint256) {\n return _calcRedemptionRate(baseRate);\n }\n\n function getRedemptionRateWithDecay() public view override returns (uint256) {\n return _calcRedemptionRate(_calcDecayedBaseRate());\n }\n\n function getRedemptionRateForRedeemedAmount(uint256 _redeemAmount) external view returns (uint256) {\n uint256 totalBoldSupply = boldToken.totalSupply();\n uint256 newBaseRate = _getUpdatedBaseRateFromRedemption(_redeemAmount, totalBoldSupply);\n return _calcRedemptionRate(newBaseRate);\n }\n\n function getRedemptionFeeWithDecay(uint256 _ETHDrawn) external view override returns (uint256) {\n return _calcRedemptionFee(getRedemptionRateWithDecay(), _ETHDrawn);\n }\n\n function getEffectiveRedemptionFeeInBold(uint256 _redeemAmount) external view override returns (uint256) {\n uint256 totalBoldSupply = boldToken.totalSupply();\n uint256 newBaseRate = _getUpdatedBaseRateFromRedemption(_redeemAmount, totalBoldSupply);\n return _calcRedemptionFee(_calcRedemptionRate(newBaseRate), _redeemAmount);\n }\n\n // getters\n\n /// @notice Get the token for a specific redeemable branch\n /// @param _index The index of token in redeemable branches array\n /// @return The token for the redeemable branch\n function getToken(uint256 _index) external view returns (IERC20Metadata) {\n return redeemableBranchesTokens[_index];\n }\n\n /// @notice Get the token for a specific non-redeemable branch\n /// @param _index The index of token in non-redeemable branches array\n /// @return The token for the non-redeemable branch\n function getNonRedeemableToken(uint256 _index) external view returns(IERC20Metadata){\n return nonRedeemableBranchesTokens[_index];\n }\n\n /// @notice Get the trove manager for a specific redeemable branch\n /// @dev ONLY returns the redeemable troves. Since this is only used for redemptions this is ideal.\n /// @param _index The index of trove manager in redeemable branches array\n /// @return The trove manager for the redeemable branch\n function getTroveManager(uint256 _index) public view returns (ITroveManager) {\n return redeemableBranchesTroveManagers[_index];\n }\n\n /// @notice Get the trove manager for a specific non-redeemable branch\n /// @dev ONLY returns the non-redeemable troves.\n /// @param _index The index of trove manager in non-redeemable branches array\n /// @return The trove manager for the non-redeemable branch\n function getNonRedeemableTroveManager(uint256 _index) public view returns(ITroveManager){\n return nonRedeemableBranchesTroveManagers[_index];\n }\n\n /// @notice Get all trove managers (redeemable and non-redeemable)\n /// @dev Just used for front end as a helper and is not a core feature.\n function getAllTroveManagers() external view returns(ITroveManager[] memory){\n ITroveManager[] memory allTroveManagers = new ITroveManager[](redeemableBranchesTroveManagers.length + nonRedeemableBranchesTroveManagers.length);\n for(uint256 i = 0; i < redeemableBranchesTroveManagers.length; i++){\n allTroveManagers[i] = redeemableBranchesTroveManagers[i];\n }\n for(uint256 i = 0; i < nonRedeemableBranchesTroveManagers.length; i++){\n allTroveManagers[redeemableBranchesTroveManagers.length + i] = nonRedeemableBranchesTroveManagers[i];\n }\n return allTroveManagers;\n }\n\n /// @notice Get all redeemable trove managers\n function getTroveManagers() external view returns(ITroveManager[] memory){\n return redeemableBranchesTroveManagers;\n }\n\n /// @notice Get all non-redeemable trove managers\n function getNonRedeemableTroveManagers() external view returns(ITroveManager[] memory){\n return nonRedeemableBranchesTroveManagers;\n }\n\n /// @notice Update the debt limit for a specific redeemable TroveManager\n /// @dev Decreases are unrestricted. Increases must satisfy at least one of the following conditions:\n /// (1) the new limit does not exceed 2x the current debt limit, or\n /// (2) the new limit does not exceed the initial debt limit.\n /// @param _indexTroveManager The index of the trove manager from redeemable branches array\n /// @param _newDebtLimit The new debt limit\n function updateDebtLimit(uint256 _indexTroveManager, uint256 _newDebtLimit) external onlyGovernor {\n uint256 currentDebtLimit = getTroveManager(_indexTroveManager).getDebtLimit();\n if (_newDebtLimit > currentDebtLimit) {\n require(_newDebtLimit <= currentDebtLimit * 2 || _newDebtLimit <= getTroveManager(_indexTroveManager).getInitialDebtLimit(), \"CollateralRegistry: Debt limit increase by more than 2x is not allowed\");\n }\n getTroveManager(_indexTroveManager).setDebtLimit(_newDebtLimit);\n }\n\n /// @notice Get the debt limit for a specific redeemable TroveManager\n /// @param _indexTroveManager The index of the trove manager from redeemable branches array\n /// @return The debt limit for the redeemable trove manager\n function getDebtLimit(uint256 _indexTroveManager) external view returns (uint256) {\n return getTroveManager(_indexTroveManager).getDebtLimit();\n }\n\n /// @notice Update the debt limit for a specific non-redeemable TroveManager\n /// @dev Decreases are unrestricted. Increases must satisfy at least one of the following conditions:\n /// (1) the new limit does not exceed 2x the current debt limit, or\n /// (2) the new limit does not exceed the initial debt limit.\n /// @param _indexTroveManager The index of the trove manager from non-redeemable branches array\n /// @param _newDebtLimit The new debt limit\n function updateNonRedeemableDebtLimit(uint256 _indexTroveManager, uint256 _newDebtLimit) external onlyGovernor {\n uint256 currentDebtLimit = getNonRedeemableTroveManager(_indexTroveManager).getDebtLimit();\n if (_newDebtLimit > currentDebtLimit) {\n require(_newDebtLimit <= currentDebtLimit * 2 || _newDebtLimit <= getNonRedeemableTroveManager(_indexTroveManager).getInitialDebtLimit(), \"CollateralRegistry: Debt limit increase by more than 2x is not allowed\");\n }\n getNonRedeemableTroveManager(_indexTroveManager).setDebtLimit(_newDebtLimit);\n }\n\n /// @notice Get the debt limit for a specific non-redeemable TroveManager\n /// @param _indexTroveManager The index of the trove manager from non-redeemable branches array\n /// @return The debt limit for the non-redeemable trove manager\n function getNonRedeemableDebtLimit(uint256 _indexTroveManager) external view returns (uint256) {\n return getNonRedeemableTroveManager(_indexTroveManager).getDebtLimit();\n }\n\n // require functions\n\n function _requireValidMaxFeePercentage(uint256 _maxFeePercentage) internal pure {\n require(\n _maxFeePercentage >= REDEMPTION_FEE_FLOOR && _maxFeePercentage <= DECIMAL_PRECISION,\n \"Max fee percentage must be between 0.5% and 100%\"\n );\n }\n\n function _requireAmountGreaterThanZero(uint256 _amount) internal pure {\n require(_amount > 0, \"CollateralRegistry: Amount must be greater than zero\");\n }\n\n /**\n * @notice Propose a new governor. The proposed address must call acceptGovernor() after the timelock has passed.\n */\n function proposeGovernor(address _newGovernor) external onlyGovernor {\n require(_newGovernor != address(0), \"CR: Governor cannot be zero address\");\n require(_newGovernor != governor, \"CR: Already governor\");\n\n pendingGovernor = _newGovernor;\n pendingGovernorTimestamp = block.timestamp;\n\n emit GovernorProposed(_newGovernor, block.timestamp + GOVERNOR_TRANSFER_TIMELOCK);\n }\n\n /**\n * @notice Accept the governor role. Callable by the pending governor after the timelock has passed.\n */\n function acceptGovernor() external {\n require(msg.sender == pendingGovernor, \"CR: Caller is not pending governor\");\n require(\n block.timestamp >= pendingGovernorTimestamp + GOVERNOR_TRANSFER_TIMELOCK,\n \"CR: Governor transfer timelock not passed\"\n );\n\n address oldGovernor = governor;\n governor = pendingGovernor;\n pendingGovernor = address(0);\n pendingGovernorTimestamp = 0;\n\n emit GovernorUpdated(oldGovernor, governor);\n }\n\n /**\n * @notice Cancel a pending governor proposal. Callable by the current governor.\n */\n function cancelGovernorProposal() external onlyGovernor {\n require(pendingGovernor != address(0), \"CR: No pending governor\");\n address cancelled = pendingGovernor;\n pendingGovernor = address(0);\n pendingGovernorTimestamp = 0;\n emit GovernorProposalCancelled(cancelled);\n }\n\n /// @notice Update the AeroManager address\n /// @dev Only allowed before any Aero LP collateral branch has been added\n /// @param _newAeroManager The new AeroManager address\n function updateAeroManager(IAeroManager _newAeroManager) external onlyGovernor {\n require(!hasAeroLPCollateralBranch, \"CR: Cannot update AeroManager with Aero LP collateral branches\");\n require(address(_newAeroManager) != address(0), \"CR: AeroManager cannot be zero address\");\n require(address(_newAeroManager) != address(aeroManager), \"CR: AeroManager already set to this address\");\n address oldAeroManager = address(aeroManager);\n aeroManager = _newAeroManager;\n emit AeroManagerUpdated(oldAeroManager, address(_newAeroManager));\n }\n\n /// @notice Update the collateral governor\n /// @param _newCollateralGovernor The new collateral governor address\n function updateCollateralGovernor(address _newCollateralGovernor) external onlyGovernor {\n require(_newCollateralGovernor != collateralGovernor, \"CR: Collateral governor already set to this address\");\n address oldGovernor = collateralGovernor;\n collateralGovernor = _newCollateralGovernor;\n emit CollateralGovernorUpdated(oldGovernor, _newCollateralGovernor);\n }\n\n /// @dev Restricts the function to the governor\n modifier onlyGovernor() {\n require(msg.sender == governor, \"CollateralRegistry: Only governor can call this function\");\n _;\n }\n}\n","deployed_bytecode":"0x608060405234801561000f575f80fd5b5060043610610189575f3560e01c80630bc17feb1461018d5780630c340a24146101b65780630cbadbd4146101c95780630e63151c146101de57806316fbb215146101f35780631b0fd707146102145780631f68f20a1461021c57806320e71545146102255780632b11551a1461023857806330504b6f146102405780633a86e60d146102485780633b293d4a1461025b57806355d569601461026e578063630afce51461028157806363f1134e146102a85780637d9c92b8146102bb5780638627a499146102ce57806395c48bd5146102f257806396edd51e146103055780639c929cc01461030e578063ab6d53bd14610321578063bfe81cf314610334578063c3bfd84214610347578063c52861f21461035a578063d380a37c14610362578063d5b356351461036b578063e3056a341461037e578063e4b50cb814610391578063e58bb639146103a4578063e5d8bb2e146103ac578063f716aad7146103bf578063fb82d09f146103c7578063fe806529146103cf575b5f80fd5b6101a061019b3660046125f2565b6103e2565b6040516101ad9190612609565b60405180910390f35b6008546101a0906001600160a01b031681565b6101d1610410565b6040516101ad919061261d565b6101f16101ec36600461268a565b610470565b005b6102066102013660046125f2565b610edf565b6040519081526020016101ad565b6101d1610f4e565b61020660065481565b6102066102333660046125f2565b610fac565b610206610fb6565b6102065f5481565b6101a06102563660046125f2565b610fc7565b6005546101a0906001600160a01b031681565b6101f161027c3660046126c1565b610fdb565b6101a07f000000000000000000000000252d36f435582ecb01686448d21e8c9ea0b2ca6581565b6102066102b63660046125f2565b61117c565b6101f16102c93660046126e1565b61121e565b6005546102e290600160a01b900460ff1681565b60405190151581526020016101ad565b6101f16103003660046126e1565b611321565b610206600a5481565b6101f161031c3660046126c1565b61146a565b6101f161032f3660046126fc565b6115ac565b6007546101a0906001600160a01b031681565b6102066103553660046125f2565b611c1e565b610206611cc1565b610206600b5481565b6102066103793660046125f2565b611ccd565b6009546101a0906001600160a01b031681565b6101a061039f3660046125f2565b611cdf565b6101f1611cf3565b6101a06103ba3660046125f2565b611e37565b6101d1611e4b565b6101f1611f8c565b6101f16103dd3660046126e1565b612057565b5f600282815481106103f6576103f6612725565b5f918252602090912001546001600160a01b031692915050565b6060600280548060200260200160405190810160405280929190818152602001828054801561046657602002820191905f5260205f20905b81546001600160a01b03168152600190910190602001808311610448575b5050505050905090565b6007546001600160a01b031633146104ec5760405162461bcd60e51b815260206004820152603460248201527f43523a204f6e6c7920636f6c6c61746572616c20676f7665726e6f722063616e60448201527320637265617465206e6577206272616e6368657360601b60648201526084015b60405180910390fd5b5f826001600160a01b03166331b8c9466040518163ffffffff1660e01b8152600401602060405180830381865afa158015610529573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061054d9190612739565b90505f836001600160a01b0316633d83908a6040518163ffffffff1660e01b8152600401602060405180830381865afa15801561058c573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906105b09190612739565b90505f846001600160a01b031663048c661d6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156105ef573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906106139190612739565b90505f856001600160a01b03166377553ad46040518163ffffffff1660e01b8152600401602060405180830381865afa158015610652573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906106769190612739565b90505f866001600160a01b0316637f7dde4a6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156106b5573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906106d99190612739565b90506001600160a01b03851661073d5760405162461bcd60e51b8152602060048201526024808201527f43523a20546f6b656e2063616e6e6f7420626520746865207a65726f206164646044820152637265737360e01b60648201526084016104e3565b6001600160a01b0384166107a85760405162461bcd60e51b815260206004820152602c60248201527f43523a2054726f7665206d616e616765722063616e6e6f74206265207468652060448201526b7a65726f206164647265737360a01b60648201526084016104e3565b7f000000000000000000000000252d36f435582ecb01686448d21e8c9ea0b2ca656001600160a01b0316856001600160a01b0316036108345760405162461bcd60e51b815260206004820152602260248201527f43523a20546f6b656e2063616e6e6f742062652074686520626f6c6420746f6b60448201526132b760f11b60648201526084016104e3565b6001600160a01b0383166108a05760405162461bcd60e51b815260206004820152602d60248201527f43523a2053746162696c69747920706f6f6c2063616e6e6f742062652074686560448201526c207a65726f206164647265737360981b60648201526084016104e3565b6001600160a01b0382166109115760405162461bcd60e51b815260206004820152603260248201527f43523a20426f72726f776572206f7065726174696f6e732063616e6e6f7420626044820152716520746865207a65726f206164647265737360701b60648201526084016104e3565b6001600160a01b03811661097a5760405162461bcd60e51b815260206004820152602a60248201527f43523a2041637469766520706f6f6c2063616e6e6f7420626520746865207a65604482015269726f206164647265737360b01b60648201526084016104e3565b836001600160a01b0316637f7dde4a6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156109b6573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906109da9190612739565b6001600160a01b0316816001600160a01b031614610a4f5760405162461bcd60e51b815260206004820152602c60248201527f43523a2041637469766520706f6f6c20646f6573206e6f74206d61746368207460448201526b3937bb329036b0b730b3b2b960a11b60648201526084016104e3565b5f816001600160a01b0316639c1926a86040518163ffffffff1660e01b8152600401602060405180830381865afa158015610a8c573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610ab09190612754565b90508015610bf557876001600160a01b0316633b293d4a6040518163ffffffff1660e01b8152600401602060405180830381865afa158015610af4573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610b189190612739565b6005546001600160a01b039081169116148015610ba957506005546040805163dab0fe0960e01b815290516001600160a01b039283169285169163dab0fe099160048083019260209291908290030181865afa158015610b7a573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610b9e9190612739565b6001600160a01b0316145b610bf55760405162461bcd60e51b815260206004820181905260248201527f43523a204165726f4d616e616765722061646472657373206d69736d6174636860448201526064016104e3565b5f8715610cd957600154600a11610c4e5760405162461bcd60e51b815260206004820152601e60248201527f43523a204d61782031302072656465656d61626c65206272616e63686573000060448201526064016104e3565b506001805480820182557fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6810180546001600160a01b03808b166001600160a01b0319928316179092556002805494850181555f527f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace90930180549189169190931617909155610d63565b506003805460018082019092557fc2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b810180546001600160a01b03808b166001600160a01b0319928316179092556004805494850181555f527f8a35acfbc15ff81a39ae7d344fd709f28e8600b4aa8c65c6b64bfe7fe36bd19b909301805491891691909316179091555b60405163c1d7eb7b60e01b81526001600160a01b0387811660048301528681166024830152858116604483015284811660648301527f000000000000000000000000252d36f435582ecb01686448d21e8c9ea0b2ca65169063c1d7eb7b906084015f604051808303815f87803b158015610ddb575f80fd5b505af1158015610ded573d5f803e3d5ffd5b50505f80549250905080610e0083612783565b90915550505f5460408051918252602082018390526001600160a01b0389811683830152881660608301528915156080830152517f0627637cbdb0893de098f353c7d4ddb76d9785a6511deab4c591b0e50c7ad3819181900360a00190a18115610ed4576005805460ff60a01b198116600160a01b17909155604051632799147b60e21b81526001600160a01b0390911690639e6451ec90610ea6908690600401612609565b5f604051808303815f87803b158015610ebd575f80fd5b505af1158015610ecf573d5f803e3d5ffd5b505050505b505050505050505050565b5f610ee982610fc7565b6001600160a01b0316637cd32a126040518163ffffffff1660e01b8152600401602060405180830381865afa158015610f24573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610f48919061279b565b92915050565b6060600480548060200260200160405190810160405280929190818152602001828054801561046657602002820191905f5260205f209081546001600160a01b03168152600190910190602001808311610448575050505050905090565b5f610ee9826103e2565b5f610fc260065461222b565b905090565b5f600482815481106103f6576103f6612725565b6008546001600160a01b031633146110055760405162461bcd60e51b81526004016104e3906127b2565b5f61100f83610fc7565b6001600160a01b0316637cd32a126040518163ffffffff1660e01b8152600401602060405180830381865afa15801561104a573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061106e919061279b565b9050808211156111145761108381600261280a565b821115806110f8575061109583610fc7565b6001600160a01b031663ded9d1a46040518163ffffffff1660e01b8152600401602060405180830381865afa1580156110d0573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906110f4919061279b565b8211155b6111145760405162461bcd60e51b81526004016104e390612821565b61111d83610fc7565b6001600160a01b0316635bb71e60836040518263ffffffff1660e01b815260040161114a91815260200190565b5f604051808303815f87803b158015611161575f80fd5b505af1158015611173573d5f803e3d5ffd5b50505050505050565b5f807f000000000000000000000000252d36f435582ecb01686448d21e8c9ea0b2ca656001600160a01b03166318160ddd6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156111da573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906111fe919061279b565b90505f61120b8483612267565b90506112168161222b565b949350505050565b6008546001600160a01b031633146112485760405162461bcd60e51b81526004016104e3906127b2565b6007546001600160a01b03908116908216036112c25760405162461bcd60e51b815260206004820152603360248201527f43523a20436f6c6c61746572616c20676f7665726e6f7220616c72656164792060448201527273657420746f2074686973206164647265737360681b60648201526084016104e3565b600780546001600160a01b038381166001600160a01b03198316179092556040519116907f4bfe4844232c537989b939c3646667bf46bce4214afbac59bd4cba11da797ba290611315908390859061288d565b60405180910390a15050565b6008546001600160a01b0316331461134b5760405162461bcd60e51b81526004016104e3906127b2565b6001600160a01b0381166113ad5760405162461bcd60e51b815260206004820152602360248201527f43523a20476f7665726e6f722063616e6e6f74206265207a65726f206164647260448201526265737360e81b60648201526084016104e3565b6008546001600160a01b03908116908216036114025760405162461bcd60e51b815260206004820152601460248201527321a91d1020b63932b0b23c9033b7bb32b93737b960611b60448201526064016104e3565b600980546001600160a01b0319166001600160a01b03831690811790915542600a8190557f7365fa02149d85f52e49234a798b79f011dcf0f7ba96edbac17b038df9a1f26590611456906203f480906128a7565b60405190815260200160405180910390a250565b6008546001600160a01b031633146114945760405162461bcd60e51b81526004016104e3906127b2565b5f61149e836103e2565b6001600160a01b0316637cd32a126040518163ffffffff1660e01b8152600401602060405180830381865afa1580156114d9573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906114fd919061279b565b9050808211156115a35761151281600261280a565b821115806115875750611524836103e2565b6001600160a01b031663ded9d1a46040518163ffffffff1660e01b8152600401602060405180830381865afa15801561155f573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611583919061279b565b8211155b6115a35760405162461bcd60e51b81526004016104e390612821565b61111d836103e2565b6115b5816122c7565b6115be83612365565b6115e560405180608001604052805f81526020015f81526020015f81526020015f81525090565b6001548082525f906001600160401b03811115611604576116046128ba565b60405190808252806020026020018201604052801561162d578160200160208202803683370190505b5090505f825f01516001600160401b0381111561164c5761164c6128ba565b604051908082528060200260200182016040528015611675578160200160208202803683370190505b5090505f5b8351811015611766575f61168d826103e2565b90505f805f836001600160a01b0316634ea15f376040518163ffffffff1660e01b81526004016060604051808303815f875af11580156116cf573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906116f391906128ce565b9250925092508186868151811061170c5761170c612725565b602002602001018181525050801561175657828860400181815161173091906128a7565b9052508651839088908790811061174957611749612725565b6020026020010181815250505b50506001909201915061167a9050565b5082604001515f036118e65782516001600160401b0381111561178b5761178b6128ba565b6040519080825280602002602001820160405280156117b4578160200160208202803683370190505b5091505f5b83518110156118e0575f6117cc826103e2565b90505f816001600160a01b0316634ea15f376040518163ffffffff1660e01b81526004016060604051808303815f875af115801561180c573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061183091906128ce565b9250505080156118d6575f826001600160a01b031663105b403b6040518163ffffffff1660e01b8152600401602060405180830381865afa158015611877573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061189b919061279b565b905080876040018181516118af91906128a7565b905250855181908790869081106118c8576118c8612725565b602002602001018181525050505b50506001016117b9565b506118fa565b82604001518611156118fa57826040015195505b7f000000000000000000000000252d36f435582ecb01686448d21e8c9ea0b2ca656001600160a01b03166318160ddd6040518163ffffffff1660e01b8152600401602060405180830381865afa158015611956573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061197a919061279b565b602084018190525f9061199790611992908990612267565b61222b565b9050848111156119f35760405162461bcd60e51b815260206004820152602160248201527f43523a204665652065786365656465642070726f7669646564206d6178696d756044820152606d60f81b60648201526084016104e3565b5f5b8451811015611b77575f848281518110611a1157611a11612725565b60200260200101511115611b6f575f8560400151858381518110611a3757611a37612725565b60200260200101518a611a4a919061280a565b611a549190612918565b90508015611b33575f611a66836103e2565b90505f816001600160a01b031663f8a239e83385898881518110611a8c57611a8c612725565b60209081029190910101516040516001600160e01b031960e086901b1681526001600160a01b0390931660048401526024830191909152604482015260648101889052608481018d905260a4016020604051808303815f875af1158015611af5573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611b19919061279b565b90508088606001818151611b2d91906128a7565b90525050505b611b3d818a61292b565b9850848281518110611b5157611b51612725565b602002602001015186604001818151611b6a919061292b565b905250505b6001016119f5565b50611b8a846060015185602001516123d1565b606084015115611173576060840151604051632770a7eb60e21b815233600482015260248101919091527f000000000000000000000000252d36f435582ecb01686448d21e8c9ea0b2ca656001600160a01b031690639dc29fac906044015f604051808303815f87803b158015611bff575f80fd5b505af1158015611c11573d5f803e3d5ffd5b5050505050505050505050565b5f807f000000000000000000000000252d36f435582ecb01686448d21e8c9ea0b2ca656001600160a01b03166318160ddd6040518163ffffffff1660e01b8152600401602060405180830381865afa158015611c7c573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611ca0919061279b565b90505f611cad8483612267565b9050611216611cbb8261222b565b85612424565b5f610fc2611992612443565b5f610f48611cd9611cc1565b83612424565b5f600182815481106103f6576103f6612725565b6009546001600160a01b03163314611d585760405162461bcd60e51b815260206004820152602260248201527f43523a2043616c6c6572206973206e6f742070656e64696e6720676f7665726e60448201526137b960f11b60648201526084016104e3565b6203f480600a54611d6991906128a7565b421015611dca5760405162461bcd60e51b815260206004820152602960248201527f43523a20476f7665726e6f72207472616e736665722074696d656c6f636b206e6044820152681bdd081c185cdcd95960ba1b60648201526084016104e3565b60088054600980546001600160a01b038082166001600160a01b03198086168217909655949091169091555f600a556040519116917f5af6a85e864342d4f108c43dd574d98480c91f1de0ac2a9f66d826dee49bd9bb91611e2c91849161288d565b60405180910390a150565b5f600382815481106103f6576103f6612725565b6004546002546060915f91611e6091906128a7565b6001600160401b03811115611e7757611e776128ba565b604051908082528060200260200182016040528015611ea0578160200160208202803683370190505b5090505f5b600254811015611f0f5760028181548110611ec257611ec2612725565b905f5260205f20015f9054906101000a90046001600160a01b0316828281518110611eef57611eef612725565b6001600160a01b0390921660209283029190910190910152600101611ea5565b505f5b600454811015611f865760048181548110611f2f57611f2f612725565b5f918252602090912001546002546001600160a01b03909116908390611f569084906128a7565b81518110611f6657611f66612725565b6001600160a01b0390921660209283029190910190910152600101611f12565b50919050565b6008546001600160a01b03163314611fb65760405162461bcd60e51b81526004016104e3906127b2565b6009546001600160a01b03166120085760405162461bcd60e51b815260206004820152601760248201527621a91d102737903832b73234b7339033b7bb32b93737b960491b60448201526064016104e3565b600980546001600160a01b031981169091555f600a8190556040516001600160a01b039092169182917f770d1c99f69ce3523bbaa053c521cbc98faf9e954d95c07d1ab05118da18e90a91a250565b6008546001600160a01b031633146120815760405162461bcd60e51b81526004016104e3906127b2565b600554600160a01b900460ff16156121015760405162461bcd60e51b815260206004820152603e60248201527f43523a2043616e6e6f7420757064617465204165726f4d616e6167657220776960448201527f7468204165726f204c5020636f6c6c61746572616c206272616e63686573000060648201526084016104e3565b6001600160a01b0381166121665760405162461bcd60e51b815260206004820152602660248201527f43523a204165726f4d616e616765722063616e6e6f74206265207a65726f206160448201526564647265737360d01b60648201526084016104e3565b6005546001600160a01b03908116908216036121d85760405162461bcd60e51b815260206004820152602b60248201527f43523a204165726f4d616e6167657220616c72656164792073657420746f207460448201526a686973206164647265737360a81b60648201526084016104e3565b600580546001600160a01b038381166001600160a01b03198316179092556040519116907f7f68d92039388b2b6d7de3b23e1fb699ede180414045d4f0e9abef80d413f64a90611315908390859061288d565b5f610f488260026122456064670de0b6b3a7640000612918565b61224f9190612918565b61225991906128a7565b670de0b6b3a764000061248c565b5f80612271612443565b90505f83612287670de0b6b3a76400008761280a565b6122919190612918565b90505f61229f600183612918565b6122a990846128a7565b90506122bd81670de0b6b3a764000061248c565b9695505050505050565b60026122dc6064670de0b6b3a7640000612918565b6122e69190612918565b81101580156122fd5750670de0b6b3a76400008111155b6123625760405162461bcd60e51b815260206004820152603060248201527f4d6178206665652070657263656e74616765206d75737420626520626574776560448201526f656e20302e352520616e64203130302560801b60648201526084016104e3565b50565b5f81116123625760405162461bcd60e51b815260206004820152603460248201527f436f6c6c61746572616c52656769737472793a20416d6f756e74206d7573742060448201527362652067726561746572207468616e207a65726f60601b60648201526084016104e3565b5f6123dc8383612267565b60068190556040518181529091507fc454ee9b76c52f782a256af821b857ca6e125d1e3333bcede402fec2bed9600c9060200160405180910390a161241f6124a3565b505050565b5f80670de0b6b3a7640000612439848661280a565b6112169190612918565b5f8061244d612507565b90505f612462670dd9e13cc602b40083612522565b9050670de0b6b3a76400008160065461247b919061280a565b6124859190612918565b9250505090565b5f81831061249a578161249c565b825b9392505050565b5f6124ac612507565b90508015612362576124bf81603c61280a565b600b5f8282546124cf91906128a7565b9091555050600b546040519081527f860f8d2f0c74dd487e89e2883e3b25b8159ce1e1b3433a291cba7b82c508f3bc90602001611e2c565b5f603c600b5442612518919061292b565b610fc29190612918565b5f631f54050082111561253757631f54050091505b815f0361254d5750670de0b6b3a7640000610f48565b670de0b6b3a764000083835b60018111156125c05761256d60028261293e565b5f036125915761257d82836125c6565b915061258a600282612918565b9050612559565b61259b82846125c6565b92506125a782836125c6565b915060026125b660018361292b565b61258a9190612918565b6122bd82845b5f806125d2838561280a565b9050670de0b6b3a76400006125e8600282612918565b61243990836128a7565b5f60208284031215612602575f80fd5b5035919050565b6001600160a01b0391909116815260200190565b602080825282518282018190525f9190848201906040850190845b8181101561265d5783516001600160a01b031683529284019291840191600101612638565b50909695505050505050565b6001600160a01b0381168114612362575f80fd5b8015158114612362575f80fd5b5f806040838503121561269b575f80fd5b82356126a681612669565b915060208301356126b68161267d565b809150509250929050565b5f80604083850312156126d2575f80fd5b50508035926020909101359150565b5f602082840312156126f1575f80fd5b813561249c81612669565b5f805f6060848603121561270e575f80fd5b505081359360208301359350604090920135919050565b634e487b7160e01b5f52603260045260245ffd5b5f60208284031215612749575f80fd5b815161249c81612669565b5f60208284031215612764575f80fd5b815161249c8161267d565b634e487b7160e01b5f52601160045260245ffd5b5f600182016127945761279461276f565b5060010190565b5f602082840312156127ab575f80fd5b5051919050565b60208082526038908201527f436f6c6c61746572616c52656769737472793a204f6e6c7920676f7665726e6f604082015277391031b0b71031b0b636103a3434b990333ab731ba34b7b760411b606082015260800190565b8082028115828204841417610f4857610f4861276f565b60208082526046908201527f436f6c6c61746572616c52656769737472793a2044656274206c696d6974206960408201527f6e637265617365206279206d6f7265207468616e203278206973206e6f7420616060820152651b1b1bddd95960d21b608082015260a00190565b6001600160a01b0392831681529116602082015260400190565b80820180821115610f4857610f4861276f565b634e487b7160e01b5f52604160045260245ffd5b5f805f606084860312156128e0575f80fd5b835192506020840151915060408401516128f98161267d565b809150509250925092565b634e487b7160e01b5f52601260045260245ffd5b5f8261292657612926612904565b500490565b81810381811115610f4857610f4861276f565b5f8261294c5761294c612904565b50069056fea2646970667358221220131ef21fbad39e9e2d8ceb1b8db001bfc9c9dd52e633c8f18cea21c362ebe12f64736f6c63430008180033","optimization_enabled":true,"verified_twin_address_hash":null,"is_verified":true,"compiler_settings":{"evmVersion":"cancun","libraries":{},"metadata":{"appendCBOR":true,"bytecodeHash":"ipfs","useLiteralContent":false},"optimizer":{"enabled":true,"runs":5},"outputSelection":{"*":{"":["*"],"*":["*"]}},"remappings":["openzeppelin/=lib/V2-gov/lib/openzeppelin-contracts/","@chimera/=lib/V2-gov/lib/chimera/src/","@openzeppelin/contracts/=lib/V2-gov/lib/openzeppelin-contracts/contracts/","Solady/=lib/Solady/src/","V2-gov/=lib/V2-gov/","chimera/=lib/V2-gov/lib/chimera/src/","ds-test/=lib/openzeppelin-contracts/lib/forge-std/lib/ds-test/src/","erc4626-tests/=lib/openzeppelin-contracts/lib/erc4626-tests/","forge-std/=lib/forge-std/src/","openzeppelin-contracts/=lib/openzeppelin-contracts/","v4-core/=lib/V2-gov/lib/v4-core/"],"viaIR":false},"optimization_runs":5,"sourcify_repo_url":null,"decoded_constructor_args":[["0x252D36F435582EcB01686448d21e8C9eA0B2Ca65",{"internalType":"contract IBoldToken","name":"_boldToken","type":"address"}],[["0x4200000000000000000000000000000000000006","0xc1CBa3fCea344f92D9239c08C0568f6F2F0ee452","0xB6fe221Fe9EeF5aBa221c348bA20A1Bf5e73624c","0x92a7aEE8AFaa71Ba0A9cC04A3DbE1F34237C33e0","0x2Ae3F1Ec7F1F5012CFEab0185bfc7aa3cf0DEc22"],{"internalType":"contract IERC20Metadata[]","name":"_tokens","type":"address[]"}],[["0xa957d42C4c43eB97D5F71b8435eb638e5DD9f639","0x79a6a3361eAE4D4B80939206426f2320C11A4bfb","0xd31987fcba98f471B6e4220C52F7741B11b2fc5e","0x835B04eeFbb0E32d8F75CFe96ACB527a42f1a0d9","0x482De97e667330afba99f8CEd527118aeC66f15D"],{"internalType":"contract ITroveManager[]","name":"_troveManagers","type":"address[]"}],["0xE8900C7aebCa7D212717Fe2f4Df9f567e3f4d7F4",{"internalType":"contract IAeroManager","name":"_aeroManager","type":"address"}],["0x519CA17DAE2E2A23396eBEC12DA1f645AccEC196",{"internalType":"address","name":"_governor","type":"address"}]],"compiler_version":"v0.8.24+commit.e11b9ed9","is_verified_via_verifier_alliance":false,"verified_at":"2026-08-01T16:55:13.701724Z","implementations":[],"proxy_type":null,"external_libraries":[],"creation_bytecode":"0x60a060405242600b5534801562000014575f80fd5b5060405162002eaf38038062002eaf8339810160408190526200003791620003cb565b8351806200008c5760405162461bcd60e51b815260206004820152601f60248201527f436f6c6c61746572616c206c6973742063616e6e6f7420626520656d7074790060448201526064015b60405180910390fd5b600a811115620000df5760405162461bcd60e51b815260206004820152601860248201527f436f6c6c61746572616c206c69737420746f6f206c6f6e670000000000000000604482015260640162000083565b5f8190556001600160a01b03868116608052600580546001600160a01b0319169185169190911790558351855114620001815760405162461bcd60e51b815260206004820152603360248201527f546f6b656e7320616e642074726f7665206d616e6167657273206d757374206860448201527f617665207468652073616d65206c656e67746800000000000000000000000000606482015260840162000083565b5f5b85518110156200023d576001868281518110620001a457620001a4620004d1565b60209081029190910181015182546001810184555f938452919092200180546001600160a01b0319166001600160a01b039092169190911790558451600290869083908110620001f857620001f8620004d1565b6020908102919091018101518254600180820185555f9485529290932090920180546001600160a01b0319166001600160a01b03909316929092179091550162000183565b50600780546001600160a01b0384166001600160a01b03199182168117909255600880549091169091179055670de0b6b3a764000060068190556040519081527fc454ee9b76c52f782a256af821b857ca6e125d1e3333bcede402fec2bed9600c9060200160405180910390a1505050505050620004e5565b6001600160a01b0381168114620002cb575f80fd5b50565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f191681016001600160401b03811182821017156200030d576200030d620002ce565b604052919050565b5f6001600160401b03821115620003305762000330620002ce565b5060051b60200190565b5f82601f8301126200034a575f80fd5b81516020620003636200035d8362000315565b620002e2565b8083825260208201915060208460051b87010193508684111562000385575f80fd5b602086015b84811015620003ae578051620003a081620002b6565b83529183019183016200038a565b509695505050505050565b8051620003c681620002b6565b919050565b5f805f805f60a08688031215620003e0575f80fd5b8551620003ed81620002b6565b602087810151919650906001600160401b03808211156200040c575f80fd5b818901915089601f83011262000420575f80fd5b8151620004316200035d8262000315565b81815260059190911b8301840190848101908c83111562000450575f80fd5b938501935b828510156200047b5784516200046b81620002b6565b8252938501939085019062000455565b60408c0151909950945050508083111562000494575f80fd5b5050620004a4888289016200033a565b935050620004b560608701620003b9565b9150620004c560808701620003b9565b90509295509295909350565b634e487b7160e01b5f52603260045260245ffd5b608051612987620005285f395f8181610286015281816107aa01528181610d9a01528181611180015281816118fc01528181611bb60152611c2201526129875ff3fe608060405234801561000f575f80fd5b5060043610610189575f3560e01c80630bc17feb1461018d5780630c340a24146101b65780630cbadbd4146101c95780630e63151c146101de57806316fbb215146101f35780631b0fd707146102145780631f68f20a1461021c57806320e71545146102255780632b11551a1461023857806330504b6f146102405780633a86e60d146102485780633b293d4a1461025b57806355d569601461026e578063630afce51461028157806363f1134e146102a85780637d9c92b8146102bb5780638627a499146102ce57806395c48bd5146102f257806396edd51e146103055780639c929cc01461030e578063ab6d53bd14610321578063bfe81cf314610334578063c3bfd84214610347578063c52861f21461035a578063d380a37c14610362578063d5b356351461036b578063e3056a341461037e578063e4b50cb814610391578063e58bb639146103a4578063e5d8bb2e146103ac578063f716aad7146103bf578063fb82d09f146103c7578063fe806529146103cf575b5f80fd5b6101a061019b3660046125f2565b6103e2565b6040516101ad9190612609565b60405180910390f35b6008546101a0906001600160a01b031681565b6101d1610410565b6040516101ad919061261d565b6101f16101ec36600461268a565b610470565b005b6102066102013660046125f2565b610edf565b6040519081526020016101ad565b6101d1610f4e565b61020660065481565b6102066102333660046125f2565b610fac565b610206610fb6565b6102065f5481565b6101a06102563660046125f2565b610fc7565b6005546101a0906001600160a01b031681565b6101f161027c3660046126c1565b610fdb565b6101a07f000000000000000000000000000000000000000000000000000000000000000081565b6102066102b63660046125f2565b61117c565b6101f16102c93660046126e1565b61121e565b6005546102e290600160a01b900460ff1681565b60405190151581526020016101ad565b6101f16103003660046126e1565b611321565b610206600a5481565b6101f161031c3660046126c1565b61146a565b6101f161032f3660046126fc565b6115ac565b6007546101a0906001600160a01b031681565b6102066103553660046125f2565b611c1e565b610206611cc1565b610206600b5481565b6102066103793660046125f2565b611ccd565b6009546101a0906001600160a01b031681565b6101a061039f3660046125f2565b611cdf565b6101f1611cf3565b6101a06103ba3660046125f2565b611e37565b6101d1611e4b565b6101f1611f8c565b6101f16103dd3660046126e1565b612057565b5f600282815481106103f6576103f6612725565b5f918252602090912001546001600160a01b031692915050565b6060600280548060200260200160405190810160405280929190818152602001828054801561046657602002820191905f5260205f20905b81546001600160a01b03168152600190910190602001808311610448575b5050505050905090565b6007546001600160a01b031633146104ec5760405162461bcd60e51b815260206004820152603460248201527f43523a204f6e6c7920636f6c6c61746572616c20676f7665726e6f722063616e60448201527320637265617465206e6577206272616e6368657360601b60648201526084015b60405180910390fd5b5f826001600160a01b03166331b8c9466040518163ffffffff1660e01b8152600401602060405180830381865afa158015610529573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061054d9190612739565b90505f836001600160a01b0316633d83908a6040518163ffffffff1660e01b8152600401602060405180830381865afa15801561058c573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906105b09190612739565b90505f846001600160a01b031663048c661d6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156105ef573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906106139190612739565b90505f856001600160a01b03166377553ad46040518163ffffffff1660e01b8152600401602060405180830381865afa158015610652573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906106769190612739565b90505f866001600160a01b0316637f7dde4a6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156106b5573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906106d99190612739565b90506001600160a01b03851661073d5760405162461bcd60e51b8152602060048201526024808201527f43523a20546f6b656e2063616e6e6f7420626520746865207a65726f206164646044820152637265737360e01b60648201526084016104e3565b6001600160a01b0384166107a85760405162461bcd60e51b815260206004820152602c60248201527f43523a2054726f7665206d616e616765722063616e6e6f74206265207468652060448201526b7a65726f206164647265737360a01b60648201526084016104e3565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316856001600160a01b0316036108345760405162461bcd60e51b815260206004820152602260248201527f43523a20546f6b656e2063616e6e6f742062652074686520626f6c6420746f6b60448201526132b760f11b60648201526084016104e3565b6001600160a01b0383166108a05760405162461bcd60e51b815260206004820152602d60248201527f43523a2053746162696c69747920706f6f6c2063616e6e6f742062652074686560448201526c207a65726f206164647265737360981b60648201526084016104e3565b6001600160a01b0382166109115760405162461bcd60e51b815260206004820152603260248201527f43523a20426f72726f776572206f7065726174696f6e732063616e6e6f7420626044820152716520746865207a65726f206164647265737360701b60648201526084016104e3565b6001600160a01b03811661097a5760405162461bcd60e51b815260206004820152602a60248201527f43523a2041637469766520706f6f6c2063616e6e6f7420626520746865207a65604482015269726f206164647265737360b01b60648201526084016104e3565b836001600160a01b0316637f7dde4a6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156109b6573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906109da9190612739565b6001600160a01b0316816001600160a01b031614610a4f5760405162461bcd60e51b815260206004820152602c60248201527f43523a2041637469766520706f6f6c20646f6573206e6f74206d61746368207460448201526b3937bb329036b0b730b3b2b960a11b60648201526084016104e3565b5f816001600160a01b0316639c1926a86040518163ffffffff1660e01b8152600401602060405180830381865afa158015610a8c573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610ab09190612754565b90508015610bf557876001600160a01b0316633b293d4a6040518163ffffffff1660e01b8152600401602060405180830381865afa158015610af4573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610b189190612739565b6005546001600160a01b039081169116148015610ba957506005546040805163dab0fe0960e01b815290516001600160a01b039283169285169163dab0fe099160048083019260209291908290030181865afa158015610b7a573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610b9e9190612739565b6001600160a01b0316145b610bf55760405162461bcd60e51b815260206004820181905260248201527f43523a204165726f4d616e616765722061646472657373206d69736d6174636860448201526064016104e3565b5f8715610cd957600154600a11610c4e5760405162461bcd60e51b815260206004820152601e60248201527f43523a204d61782031302072656465656d61626c65206272616e63686573000060448201526064016104e3565b506001805480820182557fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6810180546001600160a01b03808b166001600160a01b0319928316179092556002805494850181555f527f405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace90930180549189169190931617909155610d63565b506003805460018082019092557fc2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b810180546001600160a01b03808b166001600160a01b0319928316179092556004805494850181555f527f8a35acfbc15ff81a39ae7d344fd709f28e8600b4aa8c65c6b64bfe7fe36bd19b909301805491891691909316179091555b60405163c1d7eb7b60e01b81526001600160a01b0387811660048301528681166024830152858116604483015284811660648301527f0000000000000000000000000000000000000000000000000000000000000000169063c1d7eb7b906084015f604051808303815f87803b158015610ddb575f80fd5b505af1158015610ded573d5f803e3d5ffd5b50505f80549250905080610e0083612783565b90915550505f5460408051918252602082018390526001600160a01b0389811683830152881660608301528915156080830152517f0627637cbdb0893de098f353c7d4ddb76d9785a6511deab4c591b0e50c7ad3819181900360a00190a18115610ed4576005805460ff60a01b198116600160a01b17909155604051632799147b60e21b81526001600160a01b0390911690639e6451ec90610ea6908690600401612609565b5f604051808303815f87803b158015610ebd575f80fd5b505af1158015610ecf573d5f803e3d5ffd5b505050505b505050505050505050565b5f610ee982610fc7565b6001600160a01b0316637cd32a126040518163ffffffff1660e01b8152600401602060405180830381865afa158015610f24573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190610f48919061279b565b92915050565b6060600480548060200260200160405190810160405280929190818152602001828054801561046657602002820191905f5260205f209081546001600160a01b03168152600190910190602001808311610448575050505050905090565b5f610ee9826103e2565b5f610fc260065461222b565b905090565b5f600482815481106103f6576103f6612725565b6008546001600160a01b031633146110055760405162461bcd60e51b81526004016104e3906127b2565b5f61100f83610fc7565b6001600160a01b0316637cd32a126040518163ffffffff1660e01b8152600401602060405180830381865afa15801561104a573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061106e919061279b565b9050808211156111145761108381600261280a565b821115806110f8575061109583610fc7565b6001600160a01b031663ded9d1a46040518163ffffffff1660e01b8152600401602060405180830381865afa1580156110d0573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906110f4919061279b565b8211155b6111145760405162461bcd60e51b81526004016104e390612821565b61111d83610fc7565b6001600160a01b0316635bb71e60836040518263ffffffff1660e01b815260040161114a91815260200190565b5f604051808303815f87803b158015611161575f80fd5b505af1158015611173573d5f803e3d5ffd5b50505050505050565b5f807f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03166318160ddd6040518163ffffffff1660e01b8152600401602060405180830381865afa1580156111da573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906111fe919061279b565b90505f61120b8483612267565b90506112168161222b565b949350505050565b6008546001600160a01b031633146112485760405162461bcd60e51b81526004016104e3906127b2565b6007546001600160a01b03908116908216036112c25760405162461bcd60e51b815260206004820152603360248201527f43523a20436f6c6c61746572616c20676f7665726e6f7220616c72656164792060448201527273657420746f2074686973206164647265737360681b60648201526084016104e3565b600780546001600160a01b038381166001600160a01b03198316179092556040519116907f4bfe4844232c537989b939c3646667bf46bce4214afbac59bd4cba11da797ba290611315908390859061288d565b60405180910390a15050565b6008546001600160a01b0316331461134b5760405162461bcd60e51b81526004016104e3906127b2565b6001600160a01b0381166113ad5760405162461bcd60e51b815260206004820152602360248201527f43523a20476f7665726e6f722063616e6e6f74206265207a65726f206164647260448201526265737360e81b60648201526084016104e3565b6008546001600160a01b03908116908216036114025760405162461bcd60e51b815260206004820152601460248201527321a91d1020b63932b0b23c9033b7bb32b93737b960611b60448201526064016104e3565b600980546001600160a01b0319166001600160a01b03831690811790915542600a8190557f7365fa02149d85f52e49234a798b79f011dcf0f7ba96edbac17b038df9a1f26590611456906203f480906128a7565b60405190815260200160405180910390a250565b6008546001600160a01b031633146114945760405162461bcd60e51b81526004016104e3906127b2565b5f61149e836103e2565b6001600160a01b0316637cd32a126040518163ffffffff1660e01b8152600401602060405180830381865afa1580156114d9573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906114fd919061279b565b9050808211156115a35761151281600261280a565b821115806115875750611524836103e2565b6001600160a01b031663ded9d1a46040518163ffffffff1660e01b8152600401602060405180830381865afa15801561155f573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611583919061279b565b8211155b6115a35760405162461bcd60e51b81526004016104e390612821565b61111d836103e2565b6115b5816122c7565b6115be83612365565b6115e560405180608001604052805f81526020015f81526020015f81526020015f81525090565b6001548082525f906001600160401b03811115611604576116046128ba565b60405190808252806020026020018201604052801561162d578160200160208202803683370190505b5090505f825f01516001600160401b0381111561164c5761164c6128ba565b604051908082528060200260200182016040528015611675578160200160208202803683370190505b5090505f5b8351811015611766575f61168d826103e2565b90505f805f836001600160a01b0316634ea15f376040518163ffffffff1660e01b81526004016060604051808303815f875af11580156116cf573d5f803e3d5ffd5b505050506040513d601f19601f820116820180604052508101906116f391906128ce565b9250925092508186868151811061170c5761170c612725565b602002602001018181525050801561175657828860400181815161173091906128a7565b9052508651839088908790811061174957611749612725565b6020026020010181815250505b50506001909201915061167a9050565b5082604001515f036118e65782516001600160401b0381111561178b5761178b6128ba565b6040519080825280602002602001820160405280156117b4578160200160208202803683370190505b5091505f5b83518110156118e0575f6117cc826103e2565b90505f816001600160a01b0316634ea15f376040518163ffffffff1660e01b81526004016060604051808303815f875af115801561180c573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061183091906128ce565b9250505080156118d6575f826001600160a01b031663105b403b6040518163ffffffff1660e01b8152600401602060405180830381865afa158015611877573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061189b919061279b565b905080876040018181516118af91906128a7565b905250855181908790869081106118c8576118c8612725565b602002602001018181525050505b50506001016117b9565b506118fa565b82604001518611156118fa57826040015195505b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03166318160ddd6040518163ffffffff1660e01b8152600401602060405180830381865afa158015611956573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061197a919061279b565b602084018190525f9061199790611992908990612267565b61222b565b9050848111156119f35760405162461bcd60e51b815260206004820152602160248201527f43523a204665652065786365656465642070726f7669646564206d6178696d756044820152606d60f81b60648201526084016104e3565b5f5b8451811015611b77575f848281518110611a1157611a11612725565b60200260200101511115611b6f575f8560400151858381518110611a3757611a37612725565b60200260200101518a611a4a919061280a565b611a549190612918565b90508015611b33575f611a66836103e2565b90505f816001600160a01b031663f8a239e83385898881518110611a8c57611a8c612725565b60209081029190910101516040516001600160e01b031960e086901b1681526001600160a01b0390931660048401526024830191909152604482015260648101889052608481018d905260a4016020604051808303815f875af1158015611af5573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611b19919061279b565b90508088606001818151611b2d91906128a7565b90525050505b611b3d818a61292b565b9850848281518110611b5157611b51612725565b602002602001015186604001818151611b6a919061292b565b905250505b6001016119f5565b50611b8a846060015185602001516123d1565b606084015115611173576060840151604051632770a7eb60e21b815233600482015260248101919091527f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031690639dc29fac906044015f604051808303815f87803b158015611bff575f80fd5b505af1158015611c11573d5f803e3d5ffd5b5050505050505050505050565b5f807f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03166318160ddd6040518163ffffffff1660e01b8152600401602060405180830381865afa158015611c7c573d5f803e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611ca0919061279b565b90505f611cad8483612267565b9050611216611cbb8261222b565b85612424565b5f610fc2611992612443565b5f610f48611cd9611cc1565b83612424565b5f600182815481106103f6576103f6612725565b6009546001600160a01b03163314611d585760405162461bcd60e51b815260206004820152602260248201527f43523a2043616c6c6572206973206e6f742070656e64696e6720676f7665726e60448201526137b960f11b60648201526084016104e3565b6203f480600a54611d6991906128a7565b421015611dca5760405162461bcd60e51b815260206004820152602960248201527f43523a20476f7665726e6f72207472616e736665722074696d656c6f636b206e6044820152681bdd081c185cdcd95960ba1b60648201526084016104e3565b60088054600980546001600160a01b038082166001600160a01b03198086168217909655949091169091555f600a556040519116917f5af6a85e864342d4f108c43dd574d98480c91f1de0ac2a9f66d826dee49bd9bb91611e2c91849161288d565b60405180910390a150565b5f600382815481106103f6576103f6612725565b6004546002546060915f91611e6091906128a7565b6001600160401b03811115611e7757611e776128ba565b604051908082528060200260200182016040528015611ea0578160200160208202803683370190505b5090505f5b600254811015611f0f5760028181548110611ec257611ec2612725565b905f5260205f20015f9054906101000a90046001600160a01b0316828281518110611eef57611eef612725565b6001600160a01b0390921660209283029190910190910152600101611ea5565b505f5b600454811015611f865760048181548110611f2f57611f2f612725565b5f918252602090912001546002546001600160a01b03909116908390611f569084906128a7565b81518110611f6657611f66612725565b6001600160a01b0390921660209283029190910190910152600101611f12565b50919050565b6008546001600160a01b03163314611fb65760405162461bcd60e51b81526004016104e3906127b2565b6009546001600160a01b03166120085760405162461bcd60e51b815260206004820152601760248201527621a91d102737903832b73234b7339033b7bb32b93737b960491b60448201526064016104e3565b600980546001600160a01b031981169091555f600a8190556040516001600160a01b039092169182917f770d1c99f69ce3523bbaa053c521cbc98faf9e954d95c07d1ab05118da18e90a91a250565b6008546001600160a01b031633146120815760405162461bcd60e51b81526004016104e3906127b2565b600554600160a01b900460ff16156121015760405162461bcd60e51b815260206004820152603e60248201527f43523a2043616e6e6f7420757064617465204165726f4d616e6167657220776960448201527f7468204165726f204c5020636f6c6c61746572616c206272616e63686573000060648201526084016104e3565b6001600160a01b0381166121665760405162461bcd60e51b815260206004820152602660248201527f43523a204165726f4d616e616765722063616e6e6f74206265207a65726f206160448201526564647265737360d01b60648201526084016104e3565b6005546001600160a01b03908116908216036121d85760405162461bcd60e51b815260206004820152602b60248201527f43523a204165726f4d616e6167657220616c72656164792073657420746f207460448201526a686973206164647265737360a81b60648201526084016104e3565b600580546001600160a01b038381166001600160a01b03198316179092556040519116907f7f68d92039388b2b6d7de3b23e1fb699ede180414045d4f0e9abef80d413f64a90611315908390859061288d565b5f610f488260026122456064670de0b6b3a7640000612918565b61224f9190612918565b61225991906128a7565b670de0b6b3a764000061248c565b5f80612271612443565b90505f83612287670de0b6b3a76400008761280a565b6122919190612918565b90505f61229f600183612918565b6122a990846128a7565b90506122bd81670de0b6b3a764000061248c565b9695505050505050565b60026122dc6064670de0b6b3a7640000612918565b6122e69190612918565b81101580156122fd5750670de0b6b3a76400008111155b6123625760405162461bcd60e51b815260206004820152603060248201527f4d6178206665652070657263656e74616765206d75737420626520626574776560448201526f656e20302e352520616e64203130302560801b60648201526084016104e3565b50565b5f81116123625760405162461bcd60e51b815260206004820152603460248201527f436f6c6c61746572616c52656769737472793a20416d6f756e74206d7573742060448201527362652067726561746572207468616e207a65726f60601b60648201526084016104e3565b5f6123dc8383612267565b60068190556040518181529091507fc454ee9b76c52f782a256af821b857ca6e125d1e3333bcede402fec2bed9600c9060200160405180910390a161241f6124a3565b505050565b5f80670de0b6b3a7640000612439848661280a565b6112169190612918565b5f8061244d612507565b90505f612462670dd9e13cc602b40083612522565b9050670de0b6b3a76400008160065461247b919061280a565b6124859190612918565b9250505090565b5f81831061249a578161249c565b825b9392505050565b5f6124ac612507565b90508015612362576124bf81603c61280a565b600b5f8282546124cf91906128a7565b9091555050600b546040519081527f860f8d2f0c74dd487e89e2883e3b25b8159ce1e1b3433a291cba7b82c508f3bc90602001611e2c565b5f603c600b5442612518919061292b565b610fc29190612918565b5f631f54050082111561253757631f54050091505b815f0361254d5750670de0b6b3a7640000610f48565b670de0b6b3a764000083835b60018111156125c05761256d60028261293e565b5f036125915761257d82836125c6565b915061258a600282612918565b9050612559565b61259b82846125c6565b92506125a782836125c6565b915060026125b660018361292b565b61258a9190612918565b6122bd82845b5f806125d2838561280a565b9050670de0b6b3a76400006125e8600282612918565b61243990836128a7565b5f60208284031215612602575f80fd5b5035919050565b6001600160a01b0391909116815260200190565b602080825282518282018190525f9190848201906040850190845b8181101561265d5783516001600160a01b031683529284019291840191600101612638565b50909695505050505050565b6001600160a01b0381168114612362575f80fd5b8015158114612362575f80fd5b5f806040838503121561269b575f80fd5b82356126a681612669565b915060208301356126b68161267d565b809150509250929050565b5f80604083850312156126d2575f80fd5b50508035926020909101359150565b5f602082840312156126f1575f80fd5b813561249c81612669565b5f805f6060848603121561270e575f80fd5b505081359360208301359350604090920135919050565b634e487b7160e01b5f52603260045260245ffd5b5f60208284031215612749575f80fd5b815161249c81612669565b5f60208284031215612764575f80fd5b815161249c8161267d565b634e487b7160e01b5f52601160045260245ffd5b5f600182016127945761279461276f565b5060010190565b5f602082840312156127ab575f80fd5b5051919050565b60208082526038908201527f436f6c6c61746572616c52656769737472793a204f6e6c7920676f7665726e6f604082015277391031b0b71031b0b636103a3434b990333ab731ba34b7b760411b606082015260800190565b8082028115828204841417610f4857610f4861276f565b60208082526046908201527f436f6c6c61746572616c52656769737472793a2044656274206c696d6974206960408201527f6e637265617365206279206d6f7265207468616e203278206973206e6f7420616060820152651b1b1bddd95960d21b608082015260a00190565b6001600160a01b0392831681529116602082015260400190565b80820180821115610f4857610f4861276f565b634e487b7160e01b5f52604160045260245ffd5b5f805f606084860312156128e0575f80fd5b835192506020840151915060408401516128f98161267d565b809150509250925092565b634e487b7160e01b5f52601260045260245ffd5b5f8261292657612926612904565b500490565b81810381811115610f4857610f4861276f565b5f8261294c5761294c612904565b50069056fea2646970667358221220131ef21fbad39e9e2d8ceb1b8db001bfc9c9dd52e633c8f18cea21c362ebe12f64736f6c63430008180033000000000000000000000000252d36f435582ecb01686448d21e8c9ea0b2ca6500000000000000000000000000000000000000000000000000000000000000a00000000000000000000000000000000000000000000000000000000000000160000000000000000000000000e8900c7aebca7d212717fe2f4df9f567e3f4d7f4000000000000000000000000519ca17dae2e2a23396ebec12da1f645accec19600000000000000000000000000000000000000000000000000000000000000050000000000000000000000004200000000000000000000000000000000000006000000000000000000000000c1cba3fcea344f92d9239c08c0568f6f2f0ee452000000000000000000000000b6fe221fe9eef5aba221c348ba20a1bf5e73624c00000000000000000000000092a7aee8afaa71ba0a9cc04a3dbe1f34237c33e00000000000000000000000002ae3f1ec7f1f5012cfeab0185bfc7aa3cf0dec220000000000000000000000000000000000000000000000000000000000000005000000000000000000000000a957d42c4c43eb97d5f71b8435eb638e5dd9f63900000000000000000000000079a6a3361eae4d4b80939206426f2320c11a4bfb000000000000000000000000d31987fcba98f471b6e4220c52f7741b11b2fc5e000000000000000000000000835b04eefbb0e32d8f75cfe96acb527a42f1a0d9000000000000000000000000482de97e667330afba99f8ced527118aec66f15d","name":"CollateralRegistry","is_blueprint":false,"license_type":"none","is_fully_verified":true,"is_verified_via_eth_bytecode_db":false,"language":"solidity","evm_version":"cancun","can_be_visualized_via_sol2uml":true,"is_verified_via_sourcify":false,"additional_sources":[{"file_path":"lib/Solady/src/utils/SSTORE2.sol","source_code":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.4;\n\n/// @notice Read and write to persistent storage at a fraction of the cost.\n/// @author Solady (https://github.com/vectorized/solady/blob/main/src/utils/SSTORE2.sol)\n/// @author Saw-mon-and-Natalie (https://github.com/Saw-mon-and-Natalie)\n/// @author Modified from Solmate (https://github.com/transmissions11/solmate/blob/main/src/utils/SSTORE2.sol)\n/// @author Modified from 0xSequence (https://github.com/0xSequence/sstore2/blob/master/contracts/SSTORE2.sol)\n/// @author Modified from SSTORE3 (https://github.com/Philogy/sstore3)\nlibrary SSTORE2 {\n /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/\n /* CONSTANTS */\n /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/\n\n /// @dev The proxy initialization code.\n uint256 private constant _CREATE3_PROXY_INITCODE = 0x67363d3d37363d34f03d5260086018f3;\n\n /// @dev Hash of the `_CREATE3_PROXY_INITCODE`.\n /// Equivalent to `keccak256(abi.encodePacked(hex\"67363d3d37363d34f03d5260086018f3\"))`.\n bytes32 internal constant CREATE3_PROXY_INITCODE_HASH =\n 0x21c35dbe1b344a2488cf3321d6ce542f8e9f305544ff09e4993a62319a497c1f;\n\n /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/\n /* CUSTOM ERRORS */\n /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/\n\n /// @dev Unable to deploy the storage contract.\n error DeploymentFailed();\n\n /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/\n /* WRITE LOGIC */\n /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/\n\n /// @dev Writes `data` into the bytecode of a storage contract and returns its address.\n function write(bytes memory data) internal returns (address pointer) {\n /// @solidity memory-safe-assembly\n assembly {\n let n := mload(data) // Let `l` be `n + 1`. +1 as we prefix a STOP opcode.\n /**\n * ---------------------------------------------------+\n * Opcode | Mnemonic | Stack | Memory |\n * ---------------------------------------------------|\n * 61 l | PUSH2 l | l | |\n * 80 | DUP1 | l l | |\n * 60 0xa | PUSH1 0xa | 0xa l l | |\n * 3D | RETURNDATASIZE | 0 0xa l l | |\n * 39 | CODECOPY | l | [0..l): code |\n * 3D | RETURNDATASIZE | 0 l | [0..l): code |\n * F3 | RETURN | | [0..l): code |\n * 00 | STOP | | |\n * ---------------------------------------------------+\n * @dev Prefix the bytecode with a STOP opcode to ensure it cannot be called.\n * Also PUSH2 is used since max contract size cap is 24,576 bytes which is less than 2 ** 16.\n */\n // Do a out-of-gas revert if `n + 1` is more than 2 bytes.\n mstore(add(data, gt(n, 0xfffe)), add(0xfe61000180600a3d393df300, shl(0x40, n)))\n // Deploy a new contract with the generated creation code.\n pointer := create(0, add(data, 0x15), add(n, 0xb))\n if iszero(pointer) {\n mstore(0x00, 0x30116425) // `DeploymentFailed()`.\n revert(0x1c, 0x04)\n }\n mstore(data, n) // Restore the length of `data`.\n }\n }\n\n /// @dev Writes `data` into the bytecode of a storage contract with `salt`\n /// and returns its normal CREATE2 deterministic address.\n function writeCounterfactual(bytes memory data, bytes32 salt)\n internal\n returns (address pointer)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let n := mload(data)\n // Do a out-of-gas revert if `n + 1` is more than 2 bytes.\n mstore(add(data, gt(n, 0xfffe)), add(0xfe61000180600a3d393df300, shl(0x40, n)))\n // Deploy a new contract with the generated creation code.\n pointer := create2(0, add(data, 0x15), add(n, 0xb), salt)\n if iszero(pointer) {\n mstore(0x00, 0x30116425) // `DeploymentFailed()`.\n revert(0x1c, 0x04)\n }\n mstore(data, n) // Restore the length of `data`.\n }\n }\n\n /// @dev Writes `data` into the bytecode of a storage contract and returns its address.\n /// This uses the so-called \"CREATE3\" workflow,\n /// which means that `pointer` is agnostic to `data, and only depends on `salt`.\n function writeDeterministic(bytes memory data, bytes32 salt)\n internal\n returns (address pointer)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let n := mload(data)\n mstore(0x00, _CREATE3_PROXY_INITCODE) // Store the `_PROXY_INITCODE`.\n let proxy := create2(0, 0x10, 0x10, salt)\n if iszero(proxy) {\n mstore(0x00, 0x30116425) // `DeploymentFailed()`.\n revert(0x1c, 0x04)\n }\n mstore(0x14, proxy) // Store the proxy's address.\n // 0xd6 = 0xc0 (short RLP prefix) + 0x16 (length of: 0x94 ++ proxy ++ 0x01).\n // 0x94 = 0x80 + 0x14 (0x14 = the length of an address, 20 bytes, in hex).\n mstore(0x00, 0xd694)\n mstore8(0x34, 0x01) // Nonce of the proxy contract (1).\n pointer := keccak256(0x1e, 0x17)\n\n // Do a out-of-gas revert if `n + 1` is more than 2 bytes.\n mstore(add(data, gt(n, 0xfffe)), add(0xfe61000180600a3d393df300, shl(0x40, n)))\n if iszero(\n mul( // The arguments of `mul` are evaluated last to first.\n extcodesize(pointer),\n call(gas(), proxy, 0, add(data, 0x15), add(n, 0xb), codesize(), 0x00)\n )\n ) {\n mstore(0x00, 0x30116425) // `DeploymentFailed()`.\n revert(0x1c, 0x04)\n }\n mstore(data, n) // Restore the length of `data`.\n }\n }\n\n /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/\n /* ADDRESS CALCULATIONS */\n /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/\n\n /// @dev Returns the initialization code hash of the storage contract for `data`.\n /// Used for mining vanity addresses with create2crunch.\n function initCodeHash(bytes memory data) internal pure returns (bytes32 hash) {\n /// @solidity memory-safe-assembly\n assembly {\n let n := mload(data)\n // Do a out-of-gas revert if `n + 1` is more than 2 bytes.\n returndatacopy(returndatasize(), returndatasize(), gt(n, 0xfffe))\n mstore(data, add(0x61000180600a3d393df300, shl(0x40, n)))\n hash := keccak256(add(data, 0x15), add(n, 0xb))\n mstore(data, n) // Restore the length of `data`.\n }\n }\n\n /// @dev Equivalent to `predictCounterfactualAddress(data, salt, address(this))`\n function predictCounterfactualAddress(bytes memory data, bytes32 salt)\n internal\n view\n returns (address pointer)\n {\n pointer = predictCounterfactualAddress(data, salt, address(this));\n }\n\n /// @dev Returns the CREATE2 address of the storage contract for `data`\n /// deployed with `salt` by `deployer`.\n /// Note: The returned result has dirty upper 96 bits. Please clean if used in assembly.\n function predictCounterfactualAddress(bytes memory data, bytes32 salt, address deployer)\n internal\n pure\n returns (address predicted)\n {\n bytes32 hash = initCodeHash(data);\n /// @solidity memory-safe-assembly\n assembly {\n // Compute and store the bytecode hash.\n mstore8(0x00, 0xff) // Write the prefix.\n mstore(0x35, hash)\n mstore(0x01, shl(96, deployer))\n mstore(0x15, salt)\n predicted := keccak256(0x00, 0x55)\n // Restore the part of the free memory pointer that has been overwritten.\n mstore(0x35, 0)\n }\n }\n\n /// @dev Equivalent to `predictDeterministicAddress(salt, address(this))`.\n function predictDeterministicAddress(bytes32 salt) internal view returns (address pointer) {\n pointer = predictDeterministicAddress(salt, address(this));\n }\n\n /// @dev Returns the \"CREATE3\" deterministic address for `salt` with `deployer`.\n function predictDeterministicAddress(bytes32 salt, address deployer)\n internal\n pure\n returns (address pointer)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let m := mload(0x40) // Cache the free memory pointer.\n mstore(0x00, deployer) // Store `deployer`.\n mstore8(0x0b, 0xff) // Store the prefix.\n mstore(0x20, salt) // Store the salt.\n mstore(0x40, CREATE3_PROXY_INITCODE_HASH) // Store the bytecode hash.\n\n mstore(0x14, keccak256(0x0b, 0x55)) // Store the proxy's address.\n mstore(0x40, m) // Restore the free memory pointer.\n // 0xd6 = 0xc0 (short RLP prefix) + 0x16 (length of: 0x94 ++ proxy ++ 0x01).\n // 0x94 = 0x80 + 0x14 (0x14 = the length of an address, 20 bytes, in hex).\n mstore(0x00, 0xd694)\n mstore8(0x34, 0x01) // Nonce of the proxy contract (1).\n pointer := keccak256(0x1e, 0x17)\n }\n }\n\n /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/\n /* READ LOGIC */\n /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/\n\n /// @dev Equivalent to `read(pointer, 0, 2 ** 256 - 1)`.\n function read(address pointer) internal view returns (bytes memory data) {\n /// @solidity memory-safe-assembly\n assembly {\n data := mload(0x40)\n let n := and(sub(extcodesize(pointer), 0x01), 0xffffffffff)\n extcodecopy(pointer, add(data, 0x1f), 0x00, add(n, 0x21))\n mstore(data, n) // Store the length.\n mstore(0x40, add(n, add(data, 0x40))) // Allocate memory.\n }\n }\n\n /// @dev Equivalent to `read(pointer, start, 2 ** 256 - 1)`.\n function read(address pointer, uint256 start) internal view returns (bytes memory data) {\n /// @solidity memory-safe-assembly\n assembly {\n data := mload(0x40)\n let n := and(sub(extcodesize(pointer), 0x01), 0xffffffffff)\n extcodecopy(pointer, add(data, 0x1f), start, add(n, 0x21))\n mstore(data, mul(sub(n, start), lt(start, n))) // Store the length.\n mstore(0x40, add(data, add(0x40, mload(data)))) // Allocate memory.\n }\n }\n\n /// @dev Returns a slice of the data on `pointer` from `start` to `end`.\n /// `start` and `end` will be clamped to the range `[0, args.length]`.\n /// The `pointer` MUST be deployed via the SSTORE2 write functions.\n /// Otherwise, the behavior is undefined.\n /// Out-of-gas reverts if `pointer` does not have any code.\n function read(address pointer, uint256 start, uint256 end)\n internal\n view\n returns (bytes memory data)\n {\n /// @solidity memory-safe-assembly\n assembly {\n data := mload(0x40)\n if iszero(lt(end, 0xffff)) { end := 0xffff }\n let d := mul(sub(end, start), lt(start, end))\n extcodecopy(pointer, add(data, 0x1f), start, add(d, 0x01))\n if iszero(and(0xff, mload(add(data, d)))) {\n let n := sub(extcodesize(pointer), 0x01)\n returndatacopy(returndatasize(), returndatasize(), shr(64, n))\n d := mul(gt(n, start), sub(d, mul(gt(end, n), sub(end, n))))\n }\n mstore(data, d) // Store the length.\n mstore(add(add(data, 0x20), d), 0) // Zeroize the slot after the bytes.\n mstore(0x40, add(add(data, 0x40), d)) // Allocate memory.\n }\n }\n}\n"},{"file_path":"src/Interfaces/ILiquityBase.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"./IActivePool.sol\";\nimport \"./IDefaultPool.sol\";\n\ninterface ILiquityBase {\n function activePool() external view returns (IActivePool);\n function getEntireBranchDebt() external view returns (uint256);\n function getEntireBranchColl() external view returns (uint256);\n}\n"},{"file_path":"src/Types/LatestBatchData.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity 0.8.24;\n\nstruct LatestBatchData {\n uint256 totalDebtShares;\n uint256 entireDebtWithoutRedistribution;\n uint256 entireCollWithoutRedistribution;\n uint256 accruedInterest;\n uint256 recordedDebt;\n uint256 annualInterestRate;\n uint256 weightedRecordedDebt;\n uint256 annualManagementFee;\n uint256 accruedManagementFee;\n uint256 weightedRecordedBatchManagementFee;\n uint256 lastDebtUpdateTime;\n uint256 lastInterestRateAdjTime;\n}\n"},{"file_path":"lib/openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol","source_code":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (token/ERC20/extensions/IERC20Metadata.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../IERC20.sol\";\n\n/**\n * @dev Interface for the optional metadata functions from the ERC20 standard.\n *\n * _Available since v4.1._\n */\ninterface IERC20Metadata is IERC20 {\n /**\n * @dev Returns the name of the token.\n */\n function name() external view returns (string memory);\n\n /**\n * @dev Returns the symbol of the token.\n */\n function symbol() external view returns (string memory);\n\n /**\n * @dev Returns the decimals places of the token.\n */\n function decimals() external view returns (uint8);\n}\n"},{"file_path":"src/Interfaces/IPriceFeed.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\ninterface IPriceFeed {\n function fetchPrice() external returns (uint256, bool);\n function fetchRedemptionPrice() external returns (uint256, bool);\n function lastGoodPrice() external view returns (uint256);\n}\n"},{"file_path":"src/Interfaces/ICollSurplusPool.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"./IActivePool.sol\";\n\ninterface ICollSurplusPool {\n function getCollBalance() external view returns (uint256);\n\n function getCollateral(address _account) external view returns (uint256);\n\n function accountSurplus(address _account, uint256 _amount) external;\n\n function claimColl(address _account) external;\n\n function activePool() external view returns (IActivePool);\n}\n"},{"file_path":"src/Interfaces/ISortedTroves.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"./ITroveManager.sol\";\nimport {BatchId, BATCH_ID_ZERO} from \"../Types/BatchId.sol\";\n\ninterface ISortedTroves {\n // -- Mutating functions (permissioned) --\n function insert(uint256 _id, uint256 _annualInterestRate, uint256 _prevId, uint256 _nextId) external;\n function insertIntoBatch(\n uint256 _troveId,\n BatchId _batchId,\n uint256 _annualInterestRate,\n uint256 _prevId,\n uint256 _nextId\n ) external;\n\n function remove(uint256 _id) external;\n function removeFromBatch(uint256 _id) external;\n\n function reInsert(uint256 _id, uint256 _newAnnualInterestRate, uint256 _prevId, uint256 _nextId) external;\n function reInsertBatch(BatchId _id, uint256 _newAnnualInterestRate, uint256 _prevId, uint256 _nextId) external;\n\n // -- View functions --\n\n function contains(uint256 _id) external view returns (bool);\n function isBatchedNode(uint256 _id) external view returns (bool);\n function isEmptyBatch(BatchId _id) external view returns (bool);\n\n function isEmpty() external view returns (bool);\n function getSize() external view returns (uint256);\n\n function getFirst() external view returns (uint256);\n function getLast() external view returns (uint256);\n function getNext(uint256 _id) external view returns (uint256);\n function getPrev(uint256 _id) external view returns (uint256);\n\n function validInsertPosition(uint256 _annualInterestRate, uint256 _prevId, uint256 _nextId)\n external\n view\n returns (bool);\n function findInsertPosition(uint256 _annualInterestRate, uint256 _prevId, uint256 _nextId)\n external\n view\n returns (uint256, uint256);\n\n // Public state variable getters\n function borrowerOperationsAddress() external view returns (address);\n function troveManager() external view returns (ITroveManager);\n function size() external view returns (uint256);\n function nodes(uint256 _id) external view returns (uint256 nextId, uint256 prevId, BatchId batchId, bool exists);\n function batches(BatchId _id) external view returns (uint256 head, uint256 tail);\n}\n"},{"file_path":"src/Interfaces/ITroveManager.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"./ILiquityBase.sol\";\nimport \"./ITroveNFT.sol\";\nimport \"./IBorrowerOperations.sol\";\nimport \"./IStabilityPool.sol\";\nimport \"./IBoldToken.sol\";\nimport \"./ISortedTroves.sol\";\nimport \"./IPriceFeed.sol\";\nimport \"../Types/LatestTroveData.sol\";\nimport \"../Types/LatestBatchData.sol\";\n\n// Common interface for the Trove Manager.\ninterface ITroveManager is ILiquityBase {\n enum Status {\n nonExistent,\n active,\n closedByOwner,\n closedByLiquidation,\n zombie\n }\n\n function shutdownTime() external view returns (uint256);\n\n function troveNFT() external view returns (ITroveNFT);\n function stabilityPool() external view returns (IStabilityPool);\n //function boldToken() external view returns (IBoldToken);\n function sortedTroves() external view returns (ISortedTroves);\n function borrowerOperations() external view returns (IBorrowerOperations);\n function getPriceFeed() external view returns (IPriceFeed);\n\n function Troves(uint256 _id)\n external\n view\n returns (\n uint256 debt,\n uint256 coll,\n uint256 stake,\n Status status,\n uint64 arrayIndex,\n uint64 lastDebtUpdateTime,\n uint64 lastInterestRateAdjTime,\n uint256 annualInterestRate,\n address interestBatchManager,\n uint256 batchDebtShares\n );\n\n function rewardSnapshots(uint256 _id) external view returns (uint256 coll, uint256 boldDebt);\n\n function getTroveIdsCount() external view returns (uint256);\n\n function getTroveFromTroveIdsArray(uint256 _index) external view returns (uint256);\n\n function getCurrentICR(uint256 _troveId, uint256 _price) external view returns (uint256);\n\n function lastZombieTroveId() external view returns (uint256);\n\n function batchLiquidateTroves(uint256[] calldata _troveArray) external;\n\n function redeemCollateral(\n address _sender,\n uint256 _boldAmount,\n uint256 _price,\n uint256 _redemptionRate,\n uint256 _maxIterations\n ) external returns (uint256 _redemeedAmount);\n\n function shutdown() external;\n function urgentRedemption(uint256 _boldAmount, uint256[] calldata _troveIds, uint256 _minCollateral) external;\n\n function getUnbackedPortionPriceAndRedeemability() external returns (uint256, uint256, bool);\n\n function getLatestTroveData(uint256 _troveId) external view returns (LatestTroveData memory);\n function getTroveAnnualInterestRate(uint256 _troveId) external view returns (uint256);\n\n function getTroveStatus(uint256 _troveId) external view returns (Status);\n\n function getLatestBatchData(address _batchAddress) external view returns (LatestBatchData memory);\n\n function getInitialDebtLimit() external view returns (uint256);\n function getDebtLimit() external view returns (uint256);\n\n // -- permissioned functions called by BorrowerOperations\n\n function onOpenTrove(address _owner, uint256 _troveId, TroveChange memory _troveChange, uint256 _annualInterestRate)\n external;\n function onOpenTroveAndJoinBatch(\n address _owner,\n uint256 _troveId,\n TroveChange memory _troveChange,\n address _batchAddress,\n uint256 _batchColl,\n uint256 _batchDebt\n ) external;\n\n // Called from `adjustZombieTrove()`\n function setTroveStatusToActive(uint256 _troveId) external;\n\n function onAdjustTroveInterestRate(\n uint256 _troveId,\n uint256 _newColl,\n uint256 _newDebt,\n uint256 _newAnnualInterestRate,\n TroveChange calldata _troveChange\n ) external;\n\n function onAdjustTrove(uint256 _troveId, uint256 _newColl, uint256 _newDebt, TroveChange calldata _troveChange)\n external;\n\n function onAdjustTroveInsideBatch(\n uint256 _troveId,\n uint256 _newTroveColl,\n uint256 _newTroveDebt,\n TroveChange memory _troveChange,\n address _batchAddress,\n uint256 _newBatchColl,\n uint256 _newBatchDebt\n ) external;\n\n function onApplyTroveInterest(\n uint256 _troveId,\n uint256 _newTroveColl,\n uint256 _newTroveDebt,\n address _batchAddress,\n uint256 _newBatchColl,\n uint256 _newBatchDebt,\n TroveChange calldata _troveChange\n ) external;\n\n function onCloseTrove(\n uint256 _troveId,\n TroveChange memory _troveChange, // decrease vars: entire, with interest, batch fee and redistribution\n address _batchAddress,\n uint256 _newBatchColl,\n uint256 _newBatchDebt // entire, with interest and batch fee\n ) external;\n\n // -- batches --\n function onRegisterBatchManager(address _batchAddress, uint256 _annualInterestRate, uint256 _annualFee) external;\n function onLowerBatchManagerAnnualFee(\n address _batchAddress,\n uint256 _newColl,\n uint256 _newDebt,\n uint256 _newAnnualManagementFee\n ) external;\n function onSetBatchManagerAnnualInterestRate(\n address _batchAddress,\n uint256 _newColl,\n uint256 _newDebt,\n uint256 _newAnnualInterestRate,\n uint256 _upfrontFee // needed by BatchUpdated event\n ) external;\n\n struct OnSetInterestBatchManagerParams {\n uint256 troveId;\n uint256 troveColl; // entire, with redistribution\n uint256 troveDebt; // entire, with interest, batch fee and redistribution\n TroveChange troveChange;\n address newBatchAddress;\n uint256 newBatchColl; // updated collateral for new batch manager\n uint256 newBatchDebt; // updated debt for new batch manager\n }\n\n function onSetInterestBatchManager(OnSetInterestBatchManagerParams calldata _params) external;\n function onRemoveFromBatch(\n uint256 _troveId,\n uint256 _newTroveColl, // entire, with redistribution\n uint256 _newTroveDebt, // entire, with interest, batch fee and redistribution\n TroveChange memory _troveChange,\n address _batchAddress,\n uint256 _newBatchColl,\n uint256 _newBatchDebt, // entire, with interest and batch fee\n uint256 _newAnnualInterestRate\n ) external;\n\n function setDebtLimit(uint256 _newDebtLimit) external;\n\n // -- end of permissioned functions --\n}\n"},{"file_path":"src/Dependencies/Constants.sol","source_code":"// SPDX-License-Identifier: BUSL-1.1\npragma solidity 0.8.24;\n\naddress constant ZERO_ADDRESS = address(0);\n\nuint256 constant MAX_UINT256 = type(uint256).max;\n\nuint256 constant DECIMAL_PRECISION = 1e18;\nuint256 constant _100pct = DECIMAL_PRECISION;\nuint256 constant _1pct = DECIMAL_PRECISION / 100;\n\n// Amount of ETH to be locked in gas pool on opening troves\nuint256 constant ETH_GAS_COMPENSATION = 0.001 ether;\n\n// Liquidation\nuint256 constant MIN_LIQUIDATION_PENALTY_SP = 5e16; // 5%\nuint256 constant MAX_LIQUIDATION_PENALTY_REDISTRIBUTION = 20e16; // 20%\n\n// Collateral branch parameters (SETH = staked ETH, i.e. wstETH / rETH)\n// WETH\nuint256 constant CCR_WETH = 150 * _1pct;\nuint256 constant MCR_WETH = 110 * _1pct;\nuint256 constant SCR_WETH = 110 * _1pct;\nuint256 constant DEBT_LIMIT_WETH = 100_000_000e18;\nuint256 constant LIQUIDATION_PENALTY_SP_WETH = 5 * _1pct;\nuint256 constant LIQUIDATION_PENALTY_REDISTRIBUTION_WETH = 10 * _1pct;\n\n// SETH (wstETH, rETH, cbETH)\nuint256 constant CCR_SETH = 160 * _1pct;\nuint256 constant MCR_SETH = 110 * _1pct;\nuint256 constant SCR_SETH = 110 * _1pct;\nuint256 constant DEBT_LIMIT_SETH = 25_000_000e18;\nuint256 constant LIQUIDATION_PENALTY_SP_SETH = 5 * _1pct;\nuint256 constant LIQUIDATION_PENALTY_REDISTRIBUTION_SETH = 20 * _1pct;\n\n// cbBTC (Coinbase wrapped Bitcoin) parameters\nuint256 constant CCR_CBBTC = 150 * _1pct;\nuint256 constant MCR_CBBTC = 110 * _1pct;\nuint256 constant SCR_CBBTC = 110 * _1pct;\nuint256 constant DEBT_LIMIT_CBBTC = 10_000_000e18;\nuint256 constant LIQUIDATION_PENALTY_SP_CBBTC = 5 * _1pct;\nuint256 constant LIQUIDATION_PENALTY_REDISTRIBUTION_CBBTC = 10 * _1pct;\n\n// cbETH (Coinbase staked ETH) parameters\nuint256 constant CCR_CBETH = 160 * _1pct;\nuint256 constant MCR_CBETH = 110 * _1pct;\nuint256 constant SCR_CBETH = 110 * _1pct;\nuint256 constant DEBT_LIMIT_CBETH = 10_000_000e18;\nuint256 constant LIQUIDATION_PENALTY_SP_CBETH = 5 * _1pct;\nuint256 constant LIQUIDATION_PENALTY_REDISTRIBUTION_CBETH = 20 * _1pct;\n\n// AERO (Aerodrome token) parameters\nuint256 constant CCR_AERO = 200 * _1pct;\nuint256 constant MCR_AERO = 165 * _1pct;\nuint256 constant SCR_AERO = 165 * _1pct;\nuint256 constant DEBT_LIMIT_AERO = 1_000_000e18;\nuint256 constant LIQUIDATION_PENALTY_SP_AERO = 5 * _1pct;\nuint256 constant LIQUIDATION_PENALTY_REDISTRIBUTION_AERO = 20 * _1pct;\n\n// Aero LP Token parameters\nuint256 constant CCR_AERO_LP = 200 * _1pct;\nuint256 constant MCR_AERO_LP = 150 * _1pct;\nuint256 constant SCR_AERO_LP = 150 * _1pct;\nuint256 constant DEBT_LIMIT_AERO_LP = 1_000_000e18;\nuint256 constant LIQUIDATION_PENALTY_SP_AERO_LP = 5 * _1pct;\nuint256 constant LIQUIDATION_PENALTY_REDISTRIBUTION_AERO_LP = 20 * _1pct;\n\n// Batch CR buffer (same for all branches for now)\n// On top of MCR to join a batch, or adjust inside a batch\nuint256 constant BCR_ALL = 10 * _1pct;\n\n// Fraction of collateral awarded to liquidator\nuint256 constant COLL_GAS_COMPENSATION_DIVISOR = 200; // dividing by 200 yields 0.5%\nuint256 constant COLL_GAS_COMPENSATION_CAP = 1e16; // Max coll gas compensation capped at 0.01 ETH\n\n// Minimum amount of net Bold debt a trove must have\nuint256 constant MIN_DEBT = 200e18;\n\nuint256 constant MIN_ANNUAL_INTEREST_RATE = _1pct / 2; // 0.5%\nuint256 constant MIN_ANNUAL_INTEREST_RATE_REDEMPTION_PROTECTED_INITIAL = 3 * _1pct; // 3%\nuint256 constant MAX_ANNUAL_INTEREST_RATE = 250 * _1pct;\n\n// Batch management params\nuint128 constant MAX_ANNUAL_BATCH_MANAGEMENT_FEE = uint128(_100pct / 10); // 10%\nuint128 constant MIN_INTEREST_RATE_CHANGE_PERIOD = 1 hours; // only applies to batch managers / batched Troves\n\nuint256 constant REDEMPTION_FEE_FLOOR = _1pct / 2; // 0.5%\n\n// For the debt / shares ratio to increase by a factor 1e9\n// at a average annual debt increase (compounded interest + fees) of 10%, it would take more than 217 years (log(1e9)/log(1.1))\n// at a average annual debt increase (compounded interest + fees) of 50%, it would take more than 51 years (log(1e9)/log(1.5))\n// The increase pace could be forced to be higher through an inflation attack,\n// but precisely the fact that we have this max value now prevents the attack\nuint256 constant MAX_BATCH_SHARES_RATIO = 1e9;\n\n// Half-life of 6h. 6h = 360 min\n// (1/2) = d^360 => d = (1/2)^(1/360)\nuint256 constant REDEMPTION_MINUTE_DECAY_FACTOR = 998076443575628800;\n\n// BETA: 18 digit decimal. Parameter by which to divide the redeemed fraction, in order to calc the new base rate from a redemption.\n// Corresponds to (1 / ALPHA) in the white paper.\nuint256 constant REDEMPTION_BETA = 1;\n\n// To prevent redemptions unless Bold depegs below 0.95 and allow the system to take off\nuint256 constant INITIAL_BASE_RATE = _100pct; // 100% initial redemption rate\n\n// Discount to be used once the shutdown thas been triggered\nuint256 constant URGENT_REDEMPTION_BONUS = 2e16; // 2%\n\nuint256 constant ONE_MINUTE = 1 minutes;\nuint256 constant ONE_YEAR = 365 days;\nuint256 constant UPFRONT_INTEREST_PERIOD = 7 days;\nuint256 constant INTEREST_RATE_ADJ_COOLDOWN = 7 days;\n\nuint256 constant SP_YIELD_SPLIT = 75 * _1pct; // 75%\n\nuint256 constant GOVERNOR_TRANSFER_TIMELOCK = 3 days;\n\nuint256 constant MIN_BOLD_IN_SP = 1e18;\n\nuint256 constant AERO_MANAGER_FEE = 10 * _1pct; // 10%\nuint256 constant MAX_AERO_MANAGER_FEE = 20 * _1pct; // 20%\n\n// Dummy contract that lets legacy Hardhat tests query some of the constants\ncontract Constants {\n uint256 public constant _ETH_GAS_COMPENSATION = ETH_GAS_COMPENSATION;\n uint256 public constant _MIN_DEBT = MIN_DEBT;\n}\n"},{"file_path":"src/Interfaces/IStabilityPool.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"./IActivePool.sol\";\nimport \"./ILiquityBase.sol\";\nimport \"./IBoldToken.sol\";\nimport \"./ITroveManager.sol\";\nimport \"./IBoldRewardsReceiver.sol\";\n\n/*\n * The Stability Pool holds Bold tokens deposited by Stability Pool depositors.\n *\n * When a trove is liquidated, then depending on system conditions, some of its Bold debt gets offset with\n * Bold in the Stability Pool: that is, the offset debt evaporates, and an equal amount of Bold tokens in the Stability Pool is burned.\n *\n * Thus, a liquidation causes each depositor to receive a Bold loss, in proportion to their deposit as a share of total deposits.\n * They also receive an Coll gain, as the collateral of the liquidated trove is distributed among Stability depositors,\n * in the same proportion.\n *\n * When a liquidation occurs, it depletes every deposit by the same fraction: for example, a liquidation that depletes 40%\n * of the total Bold in the Stability Pool, depletes 40% of each deposit.\n *\n * A deposit that has experienced a series of liquidations is termed a \"compounded deposit\": each liquidation depletes the deposit,\n * multiplying it by some factor in range ]0,1[\n *\n * Please see the implementation spec in the proof document, which closely follows on from the compounded deposit / Coll gain derivations:\n * https://github.com/liquity/liquity/blob/master/papers/Scalable_Reward_Distribution_with_Compounding_Stakes.pdf\n *\n*/\ninterface IStabilityPool is ILiquityBase, IBoldRewardsReceiver {\n function boldToken() external view returns (IBoldToken);\n function troveManager() external view returns (ITroveManager);\n\n /* provideToSP():\n * - Calculates depositor's Coll gain\n * - Calculates the compounded deposit\n * - Increases deposit, and takes new snapshots of accumulators P and S\n * - Sends depositor's accumulated Coll gains to depositor\n */\n function provideToSP(uint256 _amount, bool _doClaim) external;\n\n /* withdrawFromSP():\n * - Calculates depositor's Coll gain\n * - Calculates the compounded deposit\n * - Sends the requested BOLD withdrawal to depositor\n * - (If _amount > userDeposit, the user withdraws all of their compounded deposit)\n * - Decreases deposit by withdrawn amount and takes new snapshots of accumulators P and S\n */\n function withdrawFromSP(uint256 _amount, bool doClaim) external;\n\n function claimAllCollGains() external;\n\n /*\n * Initial checks:\n * - Caller is TroveManager\n * ---\n * Cancels out the specified debt against the Bold contained in the Stability Pool (as far as possible)\n * and transfers the Trove's collateral from ActivePool to StabilityPool.\n * Only called by liquidation functions in the TroveManager.\n */\n function offset(uint256 _debt, uint256 _coll) external;\n\n function deposits(address _depositor) external view returns (uint256 initialValue);\n function stashedColl(address _depositor) external view returns (uint256);\n\n /*\n * Returns the total amount of Coll held by the pool, accounted in an internal variable instead of `balance`,\n * to exclude edge cases like Coll received from a self-destruct.\n */\n function getCollBalance() external view returns (uint256);\n\n /*\n * Returns Bold held in the pool. Changes when users deposit/withdraw, and when Trove debt is offset.\n */\n function getTotalBoldDeposits() external view returns (uint256);\n\n function getYieldGainsOwed() external view returns (uint256);\n function getYieldGainsPending() external view returns (uint256);\n\n /*\n * Calculates the Coll gain earned by the deposit since its last snapshots were taken.\n */\n function getDepositorCollGain(address _depositor) external view returns (uint256);\n\n /*\n * Calculates the BOLD yield gain earned by the deposit since its last snapshots were taken.\n */\n function getDepositorYieldGain(address _depositor) external view returns (uint256);\n\n /*\n * Calculates what `getDepositorYieldGain` will be if interest is minted now.\n */\n function getDepositorYieldGainWithPending(address _depositor) external view returns (uint256);\n\n /*\n * Return the user's compounded deposit.\n */\n function getCompoundedBoldDeposit(address _depositor) external view returns (uint256);\n\n function scaleToS(uint256 _scale) external view returns (uint256);\n\n function scaleToB(uint256 _scale) external view returns (uint256);\n\n function P() external view returns (uint256);\n function currentScale() external view returns (uint256);\n\n function P_PRECISION() external view returns (uint256);\n}\n"},{"file_path":"src/Interfaces/IDefaultPool.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\ninterface IDefaultPool {\n function troveManagerAddress() external view returns (address);\n function activePoolAddress() external view returns (address);\n // --- Functions ---\n function getCollBalance() external view returns (uint256);\n function getBoldDebt() external view returns (uint256);\n function sendCollToActivePool(uint256 _amount) external;\n function receiveColl(uint256 _amount) external;\n\n function increaseBoldDebt(uint256 _amount) external;\n function decreaseBoldDebt(uint256 _amount) external;\n}\n"},{"file_path":"src/Interfaces/IAeroManager.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"./ICollateralRegistry.sol\";\n\ninterface IAeroManager {\n function stakedAmounts(address gauge) external view returns (uint256);\n function setAeroTokenAddress(address _aeroTokenAddress) external;\n function addActivePool(address activePool) external;\n function stake(address gauge, address token, uint256 amount) external;\n function withdraw(address gauge, address token, uint256 amount) external;\n function claim(address gauge) external;\n function setAddresses(ICollateralRegistry _collateralRegistry) external;\n function governor() external view returns (address);\n}"},{"file_path":"src/NFTMetadata/utils/Utils.sol","source_code":"//SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport \"Solady/utils/LibString.sol\";\n\nlibrary numUtils {\n function toLocale(string memory _wholeNumber) internal pure returns (string memory) {\n bytes memory b = bytes(_wholeNumber);\n uint256 len = b.length;\n if (len < 4) return _wholeNumber;\n\n uint256 numCommas = (len - 1) / 3;\n\n bytes memory result = new bytes(len + numCommas);\n\n uint256 j = result.length - 1;\n uint256 k = len;\n for (uint256 i = 0; i < len; i++) {\n result[j] = b[k - 1];\n j = j > 1 ? j - 1 : 0;\n k--;\n if (k > 0 && (len - k) % 3 == 0) {\n result[j] = \",\";\n j = j > 1 ? j - 1 : 0;\n }\n }\n\n return string(result);\n }\n\n // returns a string representation of a number with commas, where result = _value / 10 ** _divisor\n function toLocaleString(uint256 _value, uint8 _divisor, uint8 _precision) internal pure returns (string memory) {\n uint256 whole;\n uint256 fraction;\n\n if (_divisor > 0) {\n whole = _value / 10 ** _divisor;\n // check if the divisor is less than the precision\n if (_divisor <= _precision) {\n fraction = (_value % 10 ** _divisor);\n // adjust fraction to be the same as the precision\n fraction = fraction * 10 ** (_precision - _divisor);\n\n // if whole is zero, then add another zero to the fraction, special case if the value is 1\n fraction = (whole == 0 && _value != 1) ? fraction * 10 : fraction;\n } else {\n fraction = (_value % 10 ** _divisor) / 10 ** (_divisor - _precision - 1);\n }\n } else {\n whole = _value;\n }\n\n string memory wholeStr = toLocale(LibString.toString(whole));\n\n if (fraction == 0) {\n if (whole > 0 && _precision > 0) wholeStr = string.concat(wholeStr, \".\");\n for (uint8 i = 0; i < _precision; i++) {\n wholeStr = string.concat(wholeStr, \"0\");\n }\n\n return wholeStr;\n }\n\n string memory fractionStr = LibString.slice(LibString.toString(fraction), 0, _precision);\n\n // pad with leading zeros\n if (_precision > bytes(fractionStr).length) {\n uint256 len = _precision - bytes(fractionStr).length;\n string memory zeroStr = \"\";\n\n for (uint8 i = 0; i < len; i++) {\n zeroStr = string.concat(zeroStr, \"0\");\n }\n\n fractionStr = string.concat(zeroStr, fractionStr);\n }\n\n return string.concat(wholeStr, _precision > 0 ? \".\" : \"\", fractionStr);\n }\n}\n\n/// @notice Core utils used extensively to format CSS and numbers.\n/// @author Modified from (https://github.com/w1nt3r-eth/hot-chain-svg/blob/main/contracts/Utils.sol) by w1nt3r-eth.\n\nlibrary utils {\n // used to simulate empty strings\n string internal constant NULL = \"\";\n\n // formats a CSS variable line. includes a semicolon for formatting.\n function setCssVar(string memory _key, string memory _val) internal pure returns (string memory) {\n return string.concat(\"--\", _key, \":\", _val, \";\");\n }\n\n // formats getting a css variable\n function getCssVar(string memory _key) internal pure returns (string memory) {\n return string.concat(\"var(--\", _key, \")\");\n }\n\n // formats getting a def URL\n function getDefURL(string memory _id) internal pure returns (string memory) {\n return string.concat(\"url(#\", _id, \")\");\n }\n\n // formats rgba white with a specified opacity / alpha\n function white_a(uint256 _a) internal pure returns (string memory) {\n return rgba(255, 255, 255, _a);\n }\n\n // formats rgba black with a specified opacity / alpha\n function black_a(uint256 _a) internal pure returns (string memory) {\n return rgba(0, 0, 0, _a);\n }\n\n // formats generic rgba color in css\n function rgba(uint256 _r, uint256 _g, uint256 _b, uint256 _a) internal pure returns (string memory) {\n string memory formattedA = _a < 100 ? string.concat(\"0.\", LibString.toString(_a)) : \"1\";\n return string.concat(\n \"rgba(\",\n LibString.toString(_r),\n \",\",\n LibString.toString(_g),\n \",\",\n LibString.toString(_b),\n \",\",\n formattedA,\n \")\"\n );\n }\n\n function cssBraces(string memory _attribute, string memory _value) internal pure returns (string memory) {\n return string.concat(\" {\", _attribute, \": \", _value, \"}\");\n }\n\n function cssBraces(string[] memory _attributes, string[] memory _values) internal pure returns (string memory) {\n require(_attributes.length == _values.length, \"Utils: Unbalanced Arrays\");\n\n uint256 len = _attributes.length;\n\n string memory results = \" {\";\n\n for (uint256 i = 0; i < len; i++) {\n results = string.concat(results, _attributes[i], \": \", _values[i], \"; \");\n }\n\n return string.concat(results, \"}\");\n }\n\n //deals with integers (i.e. no decimals)\n function points(uint256[2][] memory pointsArray) internal pure returns (string memory) {\n require(pointsArray.length >= 3, \"Utils: Array too short\");\n\n uint256 len = pointsArray.length - 1;\n\n string memory results = 'points=\"';\n\n for (uint256 i = 0; i < len; i++) {\n results = string.concat(\n results, LibString.toString(pointsArray[i][0]), \",\", LibString.toString(pointsArray[i][1]), \" \"\n );\n }\n\n return string.concat(\n results, LibString.toString(pointsArray[len][0]), \",\", LibString.toString(pointsArray[len][1]), '\"'\n );\n }\n\n // allows for a uniform precision to be applied to all points\n function points(uint256[2][] memory pointsArray, uint256 decimalPrecision) internal pure returns (string memory) {\n require(pointsArray.length >= 3, \"Utils: Array too short\");\n\n uint256 len = pointsArray.length - 1;\n\n string memory results = 'points=\"';\n\n for (uint256 i = 0; i < len; i++) {\n results = string.concat(\n results,\n toString(pointsArray[i][0], decimalPrecision),\n \",\",\n toString(pointsArray[i][1], decimalPrecision),\n \" \"\n );\n }\n\n return string.concat(\n results,\n toString(pointsArray[len][0], decimalPrecision),\n \",\",\n toString(pointsArray[len][1], decimalPrecision),\n '\"'\n );\n }\n\n // checks if two strings are equal\n function stringsEqual(string memory _a, string memory _b) internal pure returns (bool) {\n return keccak256(abi.encodePacked(_a)) == keccak256(abi.encodePacked(_b));\n }\n\n // returns the length of a string in characters\n function utfStringLength(string memory _str) internal pure returns (uint256 length) {\n uint256 i = 0;\n bytes memory string_rep = bytes(_str);\n\n while (i < string_rep.length) {\n if (string_rep[i] >> 7 == 0) {\n i += 1;\n } else if (string_rep[i] >> 5 == bytes1(uint8(0x6))) {\n i += 2;\n } else if (string_rep[i] >> 4 == bytes1(uint8(0xE))) {\n i += 3;\n } else if (string_rep[i] >> 3 == bytes1(uint8(0x1E))) {\n i += 4;\n }\n //For safety\n else {\n i += 1;\n }\n\n length++;\n }\n }\n\n // allows the insertion of a decimal point in the returned string at precision\n function toString(uint256 value, uint256 precision) internal pure returns (string memory) {\n // Inspired by OraclizeAPI's implementation - MIT licence\n // https://github.com/oraclize/ethereum-api/blob/b42146b063c7d6ee1358846c198246239e9360e8/oraclizeAPI_0.4.25.sol\n\n if (value == 0) {\n return \"0\";\n }\n uint256 temp = value;\n uint256 digits;\n while (temp != 0) {\n digits++;\n temp /= 10;\n }\n require(precision <= digits && precision > 0, \"Utils: precision invalid\");\n precision == digits ? digits += 2 : digits++; //adds a space for the decimal point, 2 if it is the whole uint\n\n uint256 decimalPlacement = digits - precision - 1;\n bytes memory buffer = new bytes(digits);\n\n buffer[decimalPlacement] = 0x2E; // add the decimal point, ASCII 46/hex 2E\n if (decimalPlacement == 1) {\n buffer[0] = 0x30;\n }\n\n while (value != 0) {\n digits -= 1;\n if (digits != decimalPlacement) {\n buffer[digits] = bytes1(uint8(48 + uint256(value % 10)));\n value /= 10;\n }\n }\n\n return string(buffer);\n }\n}\n"},{"file_path":"lib/Solady/src/utils/LibString.sol","source_code":"// SPDX-License-Identifier: MIT\npragma solidity ^0.8.4;\n\n/// @notice Library for converting numbers into strings and other string operations.\n/// @author Solady (https://github.com/vectorized/solady/blob/main/src/utils/LibString.sol)\n/// @author Modified from Solmate (https://github.com/transmissions11/solmate/blob/main/src/utils/LibString.sol)\n///\n/// @dev Note:\n/// For performance and bytecode compactness, most of the string operations are restricted to\n/// byte strings (7-bit ASCII), except where otherwise specified.\n/// Usage of byte string operations on charsets with runes spanning two or more bytes\n/// can lead to undefined behavior.\nlibrary LibString {\n /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/\n /* CUSTOM ERRORS */\n /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/\n\n /// @dev The length of the output is too small to contain all the hex digits.\n error HexLengthInsufficient();\n\n /// @dev The length of the string is more than 32 bytes.\n error TooBigForSmallString();\n\n /// @dev The input string must be a 7-bit ASCII.\n error StringNot7BitASCII();\n\n /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/\n /* CONSTANTS */\n /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/\n\n /// @dev The constant returned when the `search` is not found in the string.\n uint256 internal constant NOT_FOUND = type(uint256).max;\n\n /// @dev Lookup for '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'.\n uint128 internal constant ALPHANUMERIC_7_BIT_ASCII = 0x7fffffe07fffffe03ff000000000000;\n\n /// @dev Lookup for 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'.\n uint128 internal constant LETTERS_7_BIT_ASCII = 0x7fffffe07fffffe0000000000000000;\n\n /// @dev Lookup for 'abcdefghijklmnopqrstuvwxyz'.\n uint128 internal constant LOWERCASE_7_BIT_ASCII = 0x7fffffe000000000000000000000000;\n\n /// @dev Lookup for 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'.\n uint128 internal constant UPPERCASE_7_BIT_ASCII = 0x7fffffe0000000000000000;\n\n /// @dev Lookup for '0123456789'.\n uint128 internal constant DIGITS_7_BIT_ASCII = 0x3ff000000000000;\n\n /// @dev Lookup for '0123456789abcdefABCDEF'.\n uint128 internal constant HEXDIGITS_7_BIT_ASCII = 0x7e0000007e03ff000000000000;\n\n /// @dev Lookup for '01234567'.\n uint128 internal constant OCTDIGITS_7_BIT_ASCII = 0xff000000000000;\n\n /// @dev Lookup for '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ!\"#$%&\\'()*+,-./:;<=>?@[\\\\]^_`{|}~ \\t\\n\\r\\x0b\\x0c'.\n uint128 internal constant PRINTABLE_7_BIT_ASCII = 0x7fffffffffffffffffffffff00003e00;\n\n /// @dev Lookup for '!\"#$%&\\'()*+,-./:;<=>?@[\\\\]^_`{|}~'.\n uint128 internal constant PUNCTUATION_7_BIT_ASCII = 0x78000001f8000001fc00fffe00000000;\n\n /// @dev Lookup for ' \\t\\n\\r\\x0b\\x0c'.\n uint128 internal constant WHITESPACE_7_BIT_ASCII = 0x100003e00;\n\n /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/\n /* DECIMAL OPERATIONS */\n /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/\n\n /// @dev Returns the base 10 decimal representation of `value`.\n function toString(uint256 value) internal pure returns (string memory str) {\n /// @solidity memory-safe-assembly\n assembly {\n // The maximum value of a uint256 contains 78 digits (1 byte per digit), but\n // we allocate 0xa0 bytes to keep the free memory pointer 32-byte word aligned.\n // We will need 1 word for the trailing zeros padding, 1 word for the length,\n // and 3 words for a maximum of 78 digits.\n str := add(mload(0x40), 0x80)\n mstore(0x40, add(str, 0x20)) // Allocate the memory.\n mstore(str, 0) // Zeroize the slot after the string.\n\n let end := str // Cache the end of the memory to calculate the length later.\n let w := not(0) // Tsk.\n // We write the string from rightmost digit to leftmost digit.\n // The following is essentially a do-while loop that also handles the zero case.\n for { let temp := value } 1 {} {\n str := add(str, w) // `sub(str, 1)`.\n // Store the character to the pointer.\n // The ASCII index of the '0' character is 48.\n mstore8(str, add(48, mod(temp, 10)))\n temp := div(temp, 10) // Keep dividing `temp` until zero.\n if iszero(temp) { break }\n }\n let length := sub(end, str)\n str := sub(str, 0x20) // Move the pointer 32 bytes back to make room for the length.\n mstore(str, length) // Store the length.\n }\n }\n\n /// @dev Returns the base 10 decimal representation of `value`.\n function toString(int256 value) internal pure returns (string memory str) {\n if (value >= 0) return toString(uint256(value));\n unchecked {\n str = toString(~uint256(value) + 1);\n }\n /// @solidity memory-safe-assembly\n assembly {\n // We still have some spare memory space on the left,\n // as we have allocated 3 words (96 bytes) for up to 78 digits.\n let length := mload(str) // Load the string length.\n mstore(str, 0x2d) // Store the '-' character.\n str := sub(str, 1) // Move back the string pointer by a byte.\n mstore(str, add(length, 1)) // Update the string length.\n }\n }\n\n /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/\n /* HEXADECIMAL OPERATIONS */\n /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/\n\n /// @dev Returns the hexadecimal representation of `value`,\n /// left-padded to an input length of `length` bytes.\n /// The output is prefixed with \"0x\" encoded using 2 hexadecimal digits per byte,\n /// giving a total length of `length * 2 + 2` bytes.\n /// Reverts if `length` is too small for the output to contain all the digits.\n function toHexString(uint256 value, uint256 length) internal pure returns (string memory str) {\n str = toHexStringNoPrefix(value, length);\n /// @solidity memory-safe-assembly\n assembly {\n let strLength := add(mload(str), 2) // Compute the length.\n mstore(str, 0x3078) // Store the \"0x\" prefix.\n str := sub(str, 2) // Move the pointer.\n mstore(str, strLength) // Store the length.\n }\n }\n\n /// @dev Returns the hexadecimal representation of `value`,\n /// left-padded to an input length of `length` bytes.\n /// The output is prefixed with \"0x\" encoded using 2 hexadecimal digits per byte,\n /// giving a total length of `length * 2` bytes.\n /// Reverts if `length` is too small for the output to contain all the digits.\n function toHexStringNoPrefix(uint256 value, uint256 length)\n internal\n pure\n returns (string memory str)\n {\n /// @solidity memory-safe-assembly\n assembly {\n // We need 0x20 bytes for the trailing zeros padding, `length * 2` bytes\n // for the digits, 0x02 bytes for the prefix, and 0x20 bytes for the length.\n // We add 0x20 to the total and round down to a multiple of 0x20.\n // (0x20 + 0x20 + 0x02 + 0x20) = 0x62.\n str := add(mload(0x40), and(add(shl(1, length), 0x42), not(0x1f)))\n mstore(0x40, add(str, 0x20)) // Allocate the memory.\n mstore(str, 0) // Zeroize the slot after the string.\n\n let end := str // Cache the end to calculate the length later.\n // Store \"0123456789abcdef\" in scratch space.\n mstore(0x0f, 0x30313233343536373839616263646566)\n\n let start := sub(str, add(length, length))\n let w := not(1) // Tsk.\n let temp := value\n // We write the string from rightmost digit to leftmost digit.\n // The following is essentially a do-while loop that also handles the zero case.\n for {} 1 {} {\n str := add(str, w) // `sub(str, 2)`.\n mstore8(add(str, 1), mload(and(temp, 15)))\n mstore8(str, mload(and(shr(4, temp), 15)))\n temp := shr(8, temp)\n if iszero(xor(str, start)) { break }\n }\n if temp {\n mstore(0x00, 0x2194895a) // `HexLengthInsufficient()`.\n revert(0x1c, 0x04)\n }\n let strLength := sub(end, str)\n str := sub(str, 0x20)\n mstore(str, strLength) // Store the length.\n }\n }\n\n /// @dev Returns the hexadecimal representation of `value`.\n /// The output is prefixed with \"0x\" and encoded using 2 hexadecimal digits per byte.\n /// As address are 20 bytes long, the output will left-padded to have\n /// a length of `20 * 2 + 2` bytes.\n function toHexString(uint256 value) internal pure returns (string memory str) {\n str = toHexStringNoPrefix(value);\n /// @solidity memory-safe-assembly\n assembly {\n let strLength := add(mload(str), 2) // Compute the length.\n mstore(str, 0x3078) // Store the \"0x\" prefix.\n str := sub(str, 2) // Move the pointer.\n mstore(str, strLength) // Store the length.\n }\n }\n\n /// @dev Returns the hexadecimal representation of `value`.\n /// The output is prefixed with \"0x\".\n /// The output excludes leading \"0\" from the `toHexString` output.\n /// `0x00: \"0x0\", 0x01: \"0x1\", 0x12: \"0x12\", 0x123: \"0x123\"`.\n function toMinimalHexString(uint256 value) internal pure returns (string memory str) {\n str = toHexStringNoPrefix(value);\n /// @solidity memory-safe-assembly\n assembly {\n let o := eq(byte(0, mload(add(str, 0x20))), 0x30) // Whether leading zero is present.\n let strLength := add(mload(str), 2) // Compute the length.\n mstore(add(str, o), 0x3078) // Store the \"0x\" prefix, accounting for leading zero.\n str := sub(add(str, o), 2) // Move the pointer, accounting for leading zero.\n mstore(str, sub(strLength, o)) // Store the length, accounting for leading zero.\n }\n }\n\n /// @dev Returns the hexadecimal representation of `value`.\n /// The output excludes leading \"0\" from the `toHexStringNoPrefix` output.\n /// `0x00: \"0\", 0x01: \"1\", 0x12: \"12\", 0x123: \"123\"`.\n function toMinimalHexStringNoPrefix(uint256 value) internal pure returns (string memory str) {\n str = toHexStringNoPrefix(value);\n /// @solidity memory-safe-assembly\n assembly {\n let o := eq(byte(0, mload(add(str, 0x20))), 0x30) // Whether leading zero is present.\n let strLength := mload(str) // Get the length.\n str := add(str, o) // Move the pointer, accounting for leading zero.\n mstore(str, sub(strLength, o)) // Store the length, accounting for leading zero.\n }\n }\n\n /// @dev Returns the hexadecimal representation of `value`.\n /// The output is encoded using 2 hexadecimal digits per byte.\n /// As address are 20 bytes long, the output will left-padded to have\n /// a length of `20 * 2` bytes.\n function toHexStringNoPrefix(uint256 value) internal pure returns (string memory str) {\n /// @solidity memory-safe-assembly\n assembly {\n // We need 0x20 bytes for the trailing zeros padding, 0x20 bytes for the length,\n // 0x02 bytes for the prefix, and 0x40 bytes for the digits.\n // The next multiple of 0x20 above (0x20 + 0x20 + 0x02 + 0x40) is 0xa0.\n str := add(mload(0x40), 0x80)\n mstore(0x40, add(str, 0x20)) // Allocate the memory.\n mstore(str, 0) // Zeroize the slot after the string.\n\n let end := str // Cache the end to calculate the length later.\n mstore(0x0f, 0x30313233343536373839616263646566) // Store the \"0123456789abcdef\" lookup.\n\n let w := not(1) // Tsk.\n // We write the string from rightmost digit to leftmost digit.\n // The following is essentially a do-while loop that also handles the zero case.\n for { let temp := value } 1 {} {\n str := add(str, w) // `sub(str, 2)`.\n mstore8(add(str, 1), mload(and(temp, 15)))\n mstore8(str, mload(and(shr(4, temp), 15)))\n temp := shr(8, temp)\n if iszero(temp) { break }\n }\n let strLength := sub(end, str)\n str := sub(str, 0x20)\n mstore(str, strLength) // Store the length.\n }\n }\n\n /// @dev Returns the hexadecimal representation of `value`.\n /// The output is prefixed with \"0x\", encoded using 2 hexadecimal digits per byte,\n /// and the alphabets are capitalized conditionally according to\n /// https://eips.ethereum.org/EIPS/eip-55\n function toHexStringChecksummed(address value) internal pure returns (string memory str) {\n str = toHexString(value);\n /// @solidity memory-safe-assembly\n assembly {\n let mask := shl(6, div(not(0), 255)) // `0b010000000100000000 ...`\n let o := add(str, 0x22)\n let hashed := and(keccak256(o, 40), mul(34, mask)) // `0b10001000 ... `\n let t := shl(240, 136) // `0b10001000 << 240`\n for { let i := 0 } 1 {} {\n mstore(add(i, i), mul(t, byte(i, hashed)))\n i := add(i, 1)\n if eq(i, 20) { break }\n }\n mstore(o, xor(mload(o), shr(1, and(mload(0x00), and(mload(o), mask)))))\n o := add(o, 0x20)\n mstore(o, xor(mload(o), shr(1, and(mload(0x20), and(mload(o), mask)))))\n }\n }\n\n /// @dev Returns the hexadecimal representation of `value`.\n /// The output is prefixed with \"0x\" and encoded using 2 hexadecimal digits per byte.\n function toHexString(address value) internal pure returns (string memory str) {\n str = toHexStringNoPrefix(value);\n /// @solidity memory-safe-assembly\n assembly {\n let strLength := add(mload(str), 2) // Compute the length.\n mstore(str, 0x3078) // Store the \"0x\" prefix.\n str := sub(str, 2) // Move the pointer.\n mstore(str, strLength) // Store the length.\n }\n }\n\n /// @dev Returns the hexadecimal representation of `value`.\n /// The output is encoded using 2 hexadecimal digits per byte.\n function toHexStringNoPrefix(address value) internal pure returns (string memory str) {\n /// @solidity memory-safe-assembly\n assembly {\n str := mload(0x40)\n // Allocate the memory.\n // We need 0x20 bytes for the trailing zeros padding, 0x20 bytes for the length,\n // 0x02 bytes for the prefix, and 0x28 bytes for the digits.\n // The next multiple of 0x20 above (0x20 + 0x20 + 0x02 + 0x28) is 0x80.\n mstore(0x40, add(str, 0x80))\n mstore(0x0f, 0x30313233343536373839616263646566) // Store the \"0123456789abcdef\" lookup.\n\n str := add(str, 2)\n mstore(str, 40) // Store the length.\n let o := add(str, 0x20)\n mstore(add(o, 40), 0) // Zeroize the slot after the string.\n value := shl(96, value)\n // We write the string from rightmost digit to leftmost digit.\n // The following is essentially a do-while loop that also handles the zero case.\n for { let i := 0 } 1 {} {\n let p := add(o, add(i, i))\n let temp := byte(i, value)\n mstore8(add(p, 1), mload(and(temp, 15)))\n mstore8(p, mload(shr(4, temp)))\n i := add(i, 1)\n if eq(i, 20) { break }\n }\n }\n }\n\n /// @dev Returns the hex encoded string from the raw bytes.\n /// The output is encoded using 2 hexadecimal digits per byte.\n function toHexString(bytes memory raw) internal pure returns (string memory str) {\n str = toHexStringNoPrefix(raw);\n /// @solidity memory-safe-assembly\n assembly {\n let strLength := add(mload(str), 2) // Compute the length.\n mstore(str, 0x3078) // Store the \"0x\" prefix.\n str := sub(str, 2) // Move the pointer.\n mstore(str, strLength) // Store the length.\n }\n }\n\n /// @dev Returns the hex encoded string from the raw bytes.\n /// The output is encoded using 2 hexadecimal digits per byte.\n function toHexStringNoPrefix(bytes memory raw) internal pure returns (string memory str) {\n /// @solidity memory-safe-assembly\n assembly {\n let length := mload(raw)\n str := add(mload(0x40), 2) // Skip 2 bytes for the optional prefix.\n mstore(str, add(length, length)) // Store the length of the output.\n\n mstore(0x0f, 0x30313233343536373839616263646566) // Store the \"0123456789abcdef\" lookup.\n let o := add(str, 0x20)\n let end := add(raw, length)\n for {} iszero(eq(raw, end)) {} {\n raw := add(raw, 1)\n mstore8(add(o, 1), mload(and(mload(raw), 15)))\n mstore8(o, mload(and(shr(4, mload(raw)), 15)))\n o := add(o, 2)\n }\n mstore(o, 0) // Zeroize the slot after the string.\n mstore(0x40, add(o, 0x20)) // Allocate the memory.\n }\n }\n\n /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/\n /* RUNE STRING OPERATIONS */\n /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/\n\n /// @dev Returns the number of UTF characters in the string.\n function runeCount(string memory s) internal pure returns (uint256 result) {\n /// @solidity memory-safe-assembly\n assembly {\n if mload(s) {\n mstore(0x00, div(not(0), 255))\n mstore(0x20, 0x0202020202020202020202020202020202020202020202020303030304040506)\n let o := add(s, 0x20)\n let end := add(o, mload(s))\n for { result := 1 } 1 { result := add(result, 1) } {\n o := add(o, byte(0, mload(shr(250, mload(o)))))\n if iszero(lt(o, end)) { break }\n }\n }\n }\n }\n\n /// @dev Returns if this string is a 7-bit ASCII string.\n /// (i.e. all characters codes are in [0..127])\n function is7BitASCII(string memory s) internal pure returns (bool result) {\n /// @solidity memory-safe-assembly\n assembly {\n let mask := shl(7, div(not(0), 255))\n result := 1\n let n := mload(s)\n if n {\n let o := add(s, 0x20)\n let end := add(o, n)\n let last := mload(end)\n mstore(end, 0)\n for {} 1 {} {\n if and(mask, mload(o)) {\n result := 0\n break\n }\n o := add(o, 0x20)\n if iszero(lt(o, end)) { break }\n }\n mstore(end, last)\n }\n }\n }\n\n /// @dev Returns if this string is a 7-bit ASCII string,\n /// AND all characters are in the `allowed` lookup.\n /// Note: If `s` is empty, returns true regardless of `allowed`.\n function is7BitASCII(string memory s, uint128 allowed) internal pure returns (bool result) {\n /// @solidity memory-safe-assembly\n assembly {\n result := 1\n if mload(s) {\n let allowed_ := shr(128, shl(128, allowed))\n let o := add(s, 0x20)\n let end := add(o, mload(s))\n for {} 1 {} {\n result := and(result, shr(byte(0, mload(o)), allowed_))\n o := add(o, 1)\n if iszero(and(result, lt(o, end))) { break }\n }\n }\n }\n }\n\n /// @dev Converts the bytes in the 7-bit ASCII string `s` to\n /// an allowed lookup for use in `is7BitASCII(s, allowed)`.\n /// To save runtime gas, you can cache the result in an immutable variable.\n function to7BitASCIIAllowedLookup(string memory s) internal pure returns (uint128 result) {\n /// @solidity memory-safe-assembly\n assembly {\n if mload(s) {\n let o := add(s, 0x20)\n let end := add(o, mload(s))\n for {} 1 {} {\n result := or(result, shl(byte(0, mload(o)), 1))\n o := add(o, 1)\n if iszero(lt(o, end)) { break }\n }\n if shr(128, result) {\n mstore(0x00, 0xc9807e0d) // `StringNot7BitASCII()`.\n revert(0x1c, 0x04)\n }\n }\n }\n }\n\n /*´:°•.°+.*•´.*:˚.°*.˚•´.°:°•.°•.*•´.*:˚.°*.˚•´.°:°•.°+.*•´.*:*/\n /* BYTE STRING OPERATIONS */\n /*.•°:°.´+˚.*°.˚:*.´•*.+°.•°:´*.´•*.•°.•°:°.´:•˚°.*°.˚:*.´+°.•*/\n\n // For performance and bytecode compactness, byte string operations are restricted\n // to 7-bit ASCII strings. All offsets are byte offsets, not UTF character offsets.\n // Usage of byte string operations on charsets with runes spanning two or more bytes\n // can lead to undefined behavior.\n\n /// @dev Returns `subject` all occurrences of `search` replaced with `replacement`.\n function replace(string memory subject, string memory search, string memory replacement)\n internal\n pure\n returns (string memory result)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let subjectLength := mload(subject)\n let searchLength := mload(search)\n let replacementLength := mload(replacement)\n\n subject := add(subject, 0x20)\n search := add(search, 0x20)\n replacement := add(replacement, 0x20)\n result := add(mload(0x40), 0x20)\n\n let subjectEnd := add(subject, subjectLength)\n if iszero(gt(searchLength, subjectLength)) {\n let subjectSearchEnd := add(sub(subjectEnd, searchLength), 1)\n let h := 0\n if iszero(lt(searchLength, 0x20)) { h := keccak256(search, searchLength) }\n let m := shl(3, sub(0x20, and(searchLength, 0x1f)))\n let s := mload(search)\n for {} 1 {} {\n let t := mload(subject)\n // Whether the first `searchLength % 32` bytes of\n // `subject` and `search` matches.\n if iszero(shr(m, xor(t, s))) {\n if h {\n if iszero(eq(keccak256(subject, searchLength), h)) {\n mstore(result, t)\n result := add(result, 1)\n subject := add(subject, 1)\n if iszero(lt(subject, subjectSearchEnd)) { break }\n continue\n }\n }\n // Copy the `replacement` one word at a time.\n for { let o := 0 } 1 {} {\n mstore(add(result, o), mload(add(replacement, o)))\n o := add(o, 0x20)\n if iszero(lt(o, replacementLength)) { break }\n }\n result := add(result, replacementLength)\n subject := add(subject, searchLength)\n if searchLength {\n if iszero(lt(subject, subjectSearchEnd)) { break }\n continue\n }\n }\n mstore(result, t)\n result := add(result, 1)\n subject := add(subject, 1)\n if iszero(lt(subject, subjectSearchEnd)) { break }\n }\n }\n\n let resultRemainder := result\n result := add(mload(0x40), 0x20)\n let k := add(sub(resultRemainder, result), sub(subjectEnd, subject))\n // Copy the rest of the string one word at a time.\n for {} lt(subject, subjectEnd) {} {\n mstore(resultRemainder, mload(subject))\n resultRemainder := add(resultRemainder, 0x20)\n subject := add(subject, 0x20)\n }\n result := sub(result, 0x20)\n let last := add(add(result, 0x20), k) // Zeroize the slot after the string.\n mstore(last, 0)\n mstore(0x40, add(last, 0x20)) // Allocate the memory.\n mstore(result, k) // Store the length.\n }\n }\n\n /// @dev Returns the byte index of the first location of `search` in `subject`,\n /// searching from left to right, starting from `from`.\n /// Returns `NOT_FOUND` (i.e. `type(uint256).max`) if the `search` is not found.\n function indexOf(string memory subject, string memory search, uint256 from)\n internal\n pure\n returns (uint256 result)\n {\n /// @solidity memory-safe-assembly\n assembly {\n for { let subjectLength := mload(subject) } 1 {} {\n if iszero(mload(search)) {\n if iszero(gt(from, subjectLength)) {\n result := from\n break\n }\n result := subjectLength\n break\n }\n let searchLength := mload(search)\n let subjectStart := add(subject, 0x20)\n\n result := not(0) // Initialize to `NOT_FOUND`.\n subject := add(subjectStart, from)\n let end := add(sub(add(subjectStart, subjectLength), searchLength), 1)\n\n let m := shl(3, sub(0x20, and(searchLength, 0x1f)))\n let s := mload(add(search, 0x20))\n\n if iszero(and(lt(subject, end), lt(from, subjectLength))) { break }\n\n if iszero(lt(searchLength, 0x20)) {\n for { let h := keccak256(add(search, 0x20), searchLength) } 1 {} {\n if iszero(shr(m, xor(mload(subject), s))) {\n if eq(keccak256(subject, searchLength), h) {\n result := sub(subject, subjectStart)\n break\n }\n }\n subject := add(subject, 1)\n if iszero(lt(subject, end)) { break }\n }\n break\n }\n for {} 1 {} {\n if iszero(shr(m, xor(mload(subject), s))) {\n result := sub(subject, subjectStart)\n break\n }\n subject := add(subject, 1)\n if iszero(lt(subject, end)) { break }\n }\n break\n }\n }\n }\n\n /// @dev Returns the byte index of the first location of `search` in `subject`,\n /// searching from left to right.\n /// Returns `NOT_FOUND` (i.e. `type(uint256).max`) if the `search` is not found.\n function indexOf(string memory subject, string memory search)\n internal\n pure\n returns (uint256 result)\n {\n result = indexOf(subject, search, 0);\n }\n\n /// @dev Returns the byte index of the first location of `search` in `subject`,\n /// searching from right to left, starting from `from`.\n /// Returns `NOT_FOUND` (i.e. `type(uint256).max`) if the `search` is not found.\n function lastIndexOf(string memory subject, string memory search, uint256 from)\n internal\n pure\n returns (uint256 result)\n {\n /// @solidity memory-safe-assembly\n assembly {\n for {} 1 {} {\n result := not(0) // Initialize to `NOT_FOUND`.\n let searchLength := mload(search)\n if gt(searchLength, mload(subject)) { break }\n let w := result\n\n let fromMax := sub(mload(subject), searchLength)\n if iszero(gt(fromMax, from)) { from := fromMax }\n\n let end := add(add(subject, 0x20), w)\n subject := add(add(subject, 0x20), from)\n if iszero(gt(subject, end)) { break }\n // As this function is not too often used,\n // we shall simply use keccak256 for smaller bytecode size.\n for { let h := keccak256(add(search, 0x20), searchLength) } 1 {} {\n if eq(keccak256(subject, searchLength), h) {\n result := sub(subject, add(end, 1))\n break\n }\n subject := add(subject, w) // `sub(subject, 1)`.\n if iszero(gt(subject, end)) { break }\n }\n break\n }\n }\n }\n\n /// @dev Returns the byte index of the first location of `search` in `subject`,\n /// searching from right to left.\n /// Returns `NOT_FOUND` (i.e. `type(uint256).max`) if the `search` is not found.\n function lastIndexOf(string memory subject, string memory search)\n internal\n pure\n returns (uint256 result)\n {\n result = lastIndexOf(subject, search, uint256(int256(-1)));\n }\n\n /// @dev Returns true if `search` is found in `subject`, false otherwise.\n function contains(string memory subject, string memory search) internal pure returns (bool) {\n return indexOf(subject, search) != NOT_FOUND;\n }\n\n /// @dev Returns whether `subject` starts with `search`.\n function startsWith(string memory subject, string memory search)\n internal\n pure\n returns (bool result)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let searchLength := mload(search)\n // Just using keccak256 directly is actually cheaper.\n // forgefmt: disable-next-item\n result := and(\n iszero(gt(searchLength, mload(subject))),\n eq(\n keccak256(add(subject, 0x20), searchLength),\n keccak256(add(search, 0x20), searchLength)\n )\n )\n }\n }\n\n /// @dev Returns whether `subject` ends with `search`.\n function endsWith(string memory subject, string memory search)\n internal\n pure\n returns (bool result)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let searchLength := mload(search)\n let subjectLength := mload(subject)\n // Whether `search` is not longer than `subject`.\n let withinRange := iszero(gt(searchLength, subjectLength))\n // Just using keccak256 directly is actually cheaper.\n // forgefmt: disable-next-item\n result := and(\n withinRange,\n eq(\n keccak256(\n // `subject + 0x20 + max(subjectLength - searchLength, 0)`.\n add(add(subject, 0x20), mul(withinRange, sub(subjectLength, searchLength))),\n searchLength\n ),\n keccak256(add(search, 0x20), searchLength)\n )\n )\n }\n }\n\n /// @dev Returns `subject` repeated `times`.\n function repeat(string memory subject, uint256 times)\n internal\n pure\n returns (string memory result)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let subjectLength := mload(subject)\n if iszero(or(iszero(times), iszero(subjectLength))) {\n subject := add(subject, 0x20)\n result := mload(0x40)\n let output := add(result, 0x20)\n for {} 1 {} {\n // Copy the `subject` one word at a time.\n for { let o := 0 } 1 {} {\n mstore(add(output, o), mload(add(subject, o)))\n o := add(o, 0x20)\n if iszero(lt(o, subjectLength)) { break }\n }\n output := add(output, subjectLength)\n times := sub(times, 1)\n if iszero(times) { break }\n }\n mstore(output, 0) // Zeroize the slot after the string.\n let resultLength := sub(output, add(result, 0x20))\n mstore(result, resultLength) // Store the length.\n mstore(0x40, add(result, add(resultLength, 0x40))) // Allocate the memory.\n }\n }\n }\n\n /// @dev Returns a copy of `subject` sliced from `start` to `end` (exclusive).\n /// `start` and `end` are byte offsets.\n function slice(string memory subject, uint256 start, uint256 end)\n internal\n pure\n returns (string memory result)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let subjectLength := mload(subject)\n if iszero(gt(subjectLength, end)) { end := subjectLength }\n if iszero(gt(subjectLength, start)) { start := subjectLength }\n if lt(start, end) {\n result := mload(0x40)\n let resultLength := sub(end, start)\n mstore(result, resultLength)\n subject := add(subject, start)\n let w := not(0x1f)\n // Copy the `subject` one word at a time, backwards.\n for { let o := and(add(resultLength, 0x1f), w) } 1 {} {\n mstore(add(result, o), mload(add(subject, o)))\n o := add(o, w) // `sub(o, 0x20)`.\n if iszero(o) { break }\n }\n // Zeroize the slot after the string.\n mstore(add(add(result, 0x20), resultLength), 0)\n mstore(0x40, add(result, add(resultLength, 0x40))) // Allocate the memory.\n }\n }\n }\n\n /// @dev Returns a copy of `subject` sliced from `start` to the end of the string.\n /// `start` is a byte offset.\n function slice(string memory subject, uint256 start)\n internal\n pure\n returns (string memory result)\n {\n result = slice(subject, start, uint256(int256(-1)));\n }\n\n /// @dev Returns all the indices of `search` in `subject`.\n /// The indices are byte offsets.\n function indicesOf(string memory subject, string memory search)\n internal\n pure\n returns (uint256[] memory result)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let subjectLength := mload(subject)\n let searchLength := mload(search)\n\n if iszero(gt(searchLength, subjectLength)) {\n subject := add(subject, 0x20)\n search := add(search, 0x20)\n result := add(mload(0x40), 0x20)\n\n let subjectStart := subject\n let subjectSearchEnd := add(sub(add(subject, subjectLength), searchLength), 1)\n let h := 0\n if iszero(lt(searchLength, 0x20)) { h := keccak256(search, searchLength) }\n let m := shl(3, sub(0x20, and(searchLength, 0x1f)))\n let s := mload(search)\n for {} 1 {} {\n let t := mload(subject)\n // Whether the first `searchLength % 32` bytes of\n // `subject` and `search` matches.\n if iszero(shr(m, xor(t, s))) {\n if h {\n if iszero(eq(keccak256(subject, searchLength), h)) {\n subject := add(subject, 1)\n if iszero(lt(subject, subjectSearchEnd)) { break }\n continue\n }\n }\n // Append to `result`.\n mstore(result, sub(subject, subjectStart))\n result := add(result, 0x20)\n // Advance `subject` by `searchLength`.\n subject := add(subject, searchLength)\n if searchLength {\n if iszero(lt(subject, subjectSearchEnd)) { break }\n continue\n }\n }\n subject := add(subject, 1)\n if iszero(lt(subject, subjectSearchEnd)) { break }\n }\n let resultEnd := result\n // Assign `result` to the free memory pointer.\n result := mload(0x40)\n // Store the length of `result`.\n mstore(result, shr(5, sub(resultEnd, add(result, 0x20))))\n // Allocate memory for result.\n // We allocate one more word, so this array can be recycled for {split}.\n mstore(0x40, add(resultEnd, 0x20))\n }\n }\n }\n\n /// @dev Returns a arrays of strings based on the `delimiter` inside of the `subject` string.\n function split(string memory subject, string memory delimiter)\n internal\n pure\n returns (string[] memory result)\n {\n uint256[] memory indices = indicesOf(subject, delimiter);\n /// @solidity memory-safe-assembly\n assembly {\n let w := not(0x1f)\n let indexPtr := add(indices, 0x20)\n let indicesEnd := add(indexPtr, shl(5, add(mload(indices), 1)))\n mstore(add(indicesEnd, w), mload(subject))\n mstore(indices, add(mload(indices), 1))\n let prevIndex := 0\n for {} 1 {} {\n let index := mload(indexPtr)\n mstore(indexPtr, 0x60)\n if iszero(eq(index, prevIndex)) {\n let element := mload(0x40)\n let elementLength := sub(index, prevIndex)\n mstore(element, elementLength)\n // Copy the `subject` one word at a time, backwards.\n for { let o := and(add(elementLength, 0x1f), w) } 1 {} {\n mstore(add(element, o), mload(add(add(subject, prevIndex), o)))\n o := add(o, w) // `sub(o, 0x20)`.\n if iszero(o) { break }\n }\n // Zeroize the slot after the string.\n mstore(add(add(element, 0x20), elementLength), 0)\n // Allocate memory for the length and the bytes,\n // rounded up to a multiple of 32.\n mstore(0x40, add(element, and(add(elementLength, 0x3f), w)))\n // Store the `element` into the array.\n mstore(indexPtr, element)\n }\n prevIndex := add(index, mload(delimiter))\n indexPtr := add(indexPtr, 0x20)\n if iszero(lt(indexPtr, indicesEnd)) { break }\n }\n result := indices\n if iszero(mload(delimiter)) {\n result := add(indices, 0x20)\n mstore(result, sub(mload(indices), 2))\n }\n }\n }\n\n /// @dev Returns a concatenated string of `a` and `b`.\n /// Cheaper than `string.concat()` and does not de-align the free memory pointer.\n function concat(string memory a, string memory b)\n internal\n pure\n returns (string memory result)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let w := not(0x1f)\n result := mload(0x40)\n let aLength := mload(a)\n // Copy `a` one word at a time, backwards.\n for { let o := and(add(aLength, 0x20), w) } 1 {} {\n mstore(add(result, o), mload(add(a, o)))\n o := add(o, w) // `sub(o, 0x20)`.\n if iszero(o) { break }\n }\n let bLength := mload(b)\n let output := add(result, aLength)\n // Copy `b` one word at a time, backwards.\n for { let o := and(add(bLength, 0x20), w) } 1 {} {\n mstore(add(output, o), mload(add(b, o)))\n o := add(o, w) // `sub(o, 0x20)`.\n if iszero(o) { break }\n }\n let totalLength := add(aLength, bLength)\n let last := add(add(result, 0x20), totalLength)\n mstore(last, 0) // Zeroize the slot after the string.\n mstore(result, totalLength) // Store the length.\n mstore(0x40, add(last, 0x20)) // Allocate the memory.\n }\n }\n\n /// @dev Returns a copy of the string in either lowercase or UPPERCASE.\n /// WARNING! This function is only compatible with 7-bit ASCII strings.\n function toCase(string memory subject, bool toUpper)\n internal\n pure\n returns (string memory result)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let length := mload(subject)\n if length {\n result := add(mload(0x40), 0x20)\n subject := add(subject, 1)\n let flags := shl(add(70, shl(5, toUpper)), 0x3ffffff)\n let w := not(0)\n for { let o := length } 1 {} {\n o := add(o, w)\n let b := and(0xff, mload(add(subject, o)))\n mstore8(add(result, o), xor(b, and(shr(b, flags), 0x20)))\n if iszero(o) { break }\n }\n result := mload(0x40)\n mstore(result, length) // Store the length.\n let last := add(add(result, 0x20), length)\n mstore(last, 0) // Zeroize the slot after the string.\n mstore(0x40, add(last, 0x20)) // Allocate the memory.\n }\n }\n }\n\n /// @dev Returns a string from a small bytes32 string.\n /// `s` must be null-terminated, or behavior will be undefined.\n function fromSmallString(bytes32 s) internal pure returns (string memory result) {\n /// @solidity memory-safe-assembly\n assembly {\n result := mload(0x40)\n let n := 0\n for {} byte(n, s) { n := add(n, 1) } {} // Scan for '\\0'.\n mstore(result, n) // Store the length.\n let o := add(result, 0x20)\n mstore(o, s) // Store the bytes of the string.\n mstore(add(o, n), 0) // Zeroize the slot after the string.\n mstore(0x40, add(result, 0x40)) // Allocate the memory.\n }\n }\n\n /// @dev Returns the small string, with all bytes after the first null byte zeroized.\n function normalizeSmallString(bytes32 s) internal pure returns (bytes32 result) {\n /// @solidity memory-safe-assembly\n assembly {\n for {} byte(result, s) { result := add(result, 1) } {} // Scan for '\\0'.\n mstore(0x00, s)\n mstore(result, 0x00)\n result := mload(0x00)\n }\n }\n\n /// @dev Returns the string as a normalized null-terminated small string.\n function toSmallString(string memory s) internal pure returns (bytes32 result) {\n /// @solidity memory-safe-assembly\n assembly {\n result := mload(s)\n if iszero(lt(result, 33)) {\n mstore(0x00, 0xec92f9a3) // `TooBigForSmallString()`.\n revert(0x1c, 0x04)\n }\n result := shl(shl(3, sub(32, result)), mload(add(s, result)))\n }\n }\n\n /// @dev Returns a lowercased copy of the string.\n /// WARNING! This function is only compatible with 7-bit ASCII strings.\n function lower(string memory subject) internal pure returns (string memory result) {\n result = toCase(subject, false);\n }\n\n /// @dev Returns an UPPERCASED copy of the string.\n /// WARNING! This function is only compatible with 7-bit ASCII strings.\n function upper(string memory subject) internal pure returns (string memory result) {\n result = toCase(subject, true);\n }\n\n /// @dev Escapes the string to be used within HTML tags.\n function escapeHTML(string memory s) internal pure returns (string memory result) {\n /// @solidity memory-safe-assembly\n assembly {\n let end := add(s, mload(s))\n result := add(mload(0x40), 0x20)\n // Store the bytes of the packed offsets and strides into the scratch space.\n // `packed = (stride << 5) | offset`. Max offset is 20. Max stride is 6.\n mstore(0x1f, 0x900094)\n mstore(0x08, 0xc0000000a6ab)\n // Store \""&'<>\" into the scratch space.\n mstore(0x00, shl(64, 0x2671756f743b26616d703b262333393b266c743b2667743b))\n for {} iszero(eq(s, end)) {} {\n s := add(s, 1)\n let c := and(mload(s), 0xff)\n // Not in `[\"\\\"\",\"'\",\"&\",\"<\",\">\"]`.\n if iszero(and(shl(c, 1), 0x500000c400000000)) {\n mstore8(result, c)\n result := add(result, 1)\n continue\n }\n let t := shr(248, mload(c))\n mstore(result, mload(and(t, 0x1f)))\n result := add(result, shr(5, t))\n }\n let last := result\n mstore(last, 0) // Zeroize the slot after the string.\n result := mload(0x40)\n mstore(result, sub(last, add(result, 0x20))) // Store the length.\n mstore(0x40, add(last, 0x20)) // Allocate the memory.\n }\n }\n\n /// @dev Escapes the string to be used within double-quotes in a JSON.\n /// If `addDoubleQuotes` is true, the result will be enclosed in double-quotes.\n function escapeJSON(string memory s, bool addDoubleQuotes)\n internal\n pure\n returns (string memory result)\n {\n /// @solidity memory-safe-assembly\n assembly {\n let end := add(s, mload(s))\n result := add(mload(0x40), 0x20)\n if addDoubleQuotes {\n mstore8(result, 34)\n result := add(1, result)\n }\n // Store \"\\\\u0000\" in scratch space.\n // Store \"0123456789abcdef\" in scratch space.\n // Also, store `{0x08:\"b\", 0x09:\"t\", 0x0a:\"n\", 0x0c:\"f\", 0x0d:\"r\"}`.\n // into the scratch space.\n mstore(0x15, 0x5c75303030303031323334353637383961626364656662746e006672)\n // Bitmask for detecting `[\"\\\"\",\"\\\\\"]`.\n let e := or(shl(0x22, 1), shl(0x5c, 1))\n for {} iszero(eq(s, end)) {} {\n s := add(s, 1)\n let c := and(mload(s), 0xff)\n if iszero(lt(c, 0x20)) {\n if iszero(and(shl(c, 1), e)) {\n // Not in `[\"\\\"\",\"\\\\\"]`.\n mstore8(result, c)\n result := add(result, 1)\n continue\n }\n mstore8(result, 0x5c) // \"\\\\\".\n mstore8(add(result, 1), c)\n result := add(result, 2)\n continue\n }\n if iszero(and(shl(c, 1), 0x3700)) {\n // Not in `[\"\\b\",\"\\t\",\"\\n\",\"\\f\",\"\\d\"]`.\n mstore8(0x1d, mload(shr(4, c))) // Hex value.\n mstore8(0x1e, mload(and(c, 15))) // Hex value.\n mstore(result, mload(0x19)) // \"\\\\u00XX\".\n result := add(result, 6)\n continue\n }\n mstore8(result, 0x5c) // \"\\\\\".\n mstore8(add(result, 1), mload(add(c, 8)))\n result := add(result, 2)\n }\n if addDoubleQuotes {\n mstore8(result, 34)\n result := add(1, result)\n }\n let last := result\n mstore(last, 0) // Zeroize the slot after the string.\n result := mload(0x40)\n mstore(result, sub(last, add(result, 0x20))) // Store the length.\n mstore(0x40, add(last, 0x20)) // Allocate the memory.\n }\n }\n\n /// @dev Escapes the string to be used within double-quotes in a JSON.\n function escapeJSON(string memory s) internal pure returns (string memory result) {\n result = escapeJSON(s, false);\n }\n\n /// @dev Returns whether `a` equals `b`.\n function eq(string memory a, string memory b) internal pure returns (bool result) {\n /// @solidity memory-safe-assembly\n assembly {\n result := eq(keccak256(add(a, 0x20), mload(a)), keccak256(add(b, 0x20), mload(b)))\n }\n }\n\n /// @dev Returns whether `a` equals `b`, where `b` is a null-terminated small string.\n function eqs(string memory a, bytes32 b) internal pure returns (bool result) {\n /// @solidity memory-safe-assembly\n assembly {\n // These should be evaluated on compile time, as far as possible.\n let m := not(shl(7, div(not(iszero(b)), 255))) // `0x7f7f ...`.\n let x := not(or(m, or(b, add(m, and(b, m)))))\n let r := shl(7, iszero(iszero(shr(128, x))))\n r := or(r, shl(6, iszero(iszero(shr(64, shr(r, x))))))\n r := or(r, shl(5, lt(0xffffffff, shr(r, x))))\n r := or(r, shl(4, lt(0xffff, shr(r, x))))\n r := or(r, shl(3, lt(0xff, shr(r, x))))\n // forgefmt: disable-next-item\n result := gt(eq(mload(a), add(iszero(x), xor(31, shr(3, r)))),\n xor(shr(add(8, r), b), shr(add(8, r), mload(add(a, 0x20)))))\n }\n }\n\n /// @dev Packs a single string with its length into a single word.\n /// Returns `bytes32(0)` if the length is zero or greater than 31.\n function packOne(string memory a) internal pure returns (bytes32 result) {\n /// @solidity memory-safe-assembly\n assembly {\n // We don't need to zero right pad the string,\n // since this is our own custom non-standard packing scheme.\n result :=\n mul(\n // Load the length and the bytes.\n mload(add(a, 0x1f)),\n // `length != 0 && length < 32`. Abuses underflow.\n // Assumes that the length is valid and within the block gas limit.\n lt(sub(mload(a), 1), 0x1f)\n )\n }\n }\n\n /// @dev Unpacks a string packed using {packOne}.\n /// Returns the empty string if `packed` is `bytes32(0)`.\n /// If `packed` is not an output of {packOne}, the output behavior is undefined.\n function unpackOne(bytes32 packed) internal pure returns (string memory result) {\n /// @solidity memory-safe-assembly\n assembly {\n result := mload(0x40) // Grab the free memory pointer.\n mstore(0x40, add(result, 0x40)) // Allocate 2 words (1 for the length, 1 for the bytes).\n mstore(result, 0) // Zeroize the length slot.\n mstore(add(result, 0x1f), packed) // Store the length and bytes.\n mstore(add(add(result, 0x20), mload(result)), 0) // Right pad with zeroes.\n }\n }\n\n /// @dev Packs two strings with their lengths into a single word.\n /// Returns `bytes32(0)` if combined length is zero or greater than 30.\n function packTwo(string memory a, string memory b) internal pure returns (bytes32 result) {\n /// @solidity memory-safe-assembly\n assembly {\n let aLength := mload(a)\n // We don't need to zero right pad the strings,\n // since this is our own custom non-standard packing scheme.\n result :=\n mul(\n or( // Load the length and the bytes of `a` and `b`.\n shl(shl(3, sub(0x1f, aLength)), mload(add(a, aLength))),\n mload(sub(add(b, 0x1e), aLength))\n ),\n // `totalLength != 0 && totalLength < 31`. Abuses underflow.\n // Assumes that the lengths are valid and within the block gas limit.\n lt(sub(add(aLength, mload(b)), 1), 0x1e)\n )\n }\n }\n\n /// @dev Unpacks strings packed using {packTwo}.\n /// Returns the empty strings if `packed` is `bytes32(0)`.\n /// If `packed` is not an output of {packTwo}, the output behavior is undefined.\n function unpackTwo(bytes32 packed)\n internal\n pure\n returns (string memory resultA, string memory resultB)\n {\n /// @solidity memory-safe-assembly\n assembly {\n resultA := mload(0x40) // Grab the free memory pointer.\n resultB := add(resultA, 0x40)\n // Allocate 2 words for each string (1 for the length, 1 for the byte). Total 4 words.\n mstore(0x40, add(resultB, 0x40))\n // Zeroize the length slots.\n mstore(resultA, 0)\n mstore(resultB, 0)\n // Store the lengths and bytes.\n mstore(add(resultA, 0x1f), packed)\n mstore(add(resultB, 0x1f), mload(add(add(resultA, 0x20), mload(resultA))))\n // Right pad with zeroes.\n mstore(add(add(resultA, 0x20), mload(resultA)), 0)\n mstore(add(add(resultB, 0x20), mload(resultB)), 0)\n }\n }\n\n /// @dev Directly returns `a` without copying.\n function directReturn(string memory a) internal pure {\n assembly {\n // Assumes that the string does not start from the scratch space.\n let retStart := sub(a, 0x20)\n let retUnpaddedSize := add(mload(a), 0x40)\n // Right pad with zeroes. Just in case the string is produced\n // by a method that doesn't zero right pad.\n mstore(add(retStart, retUnpaddedSize), 0)\n mstore(retStart, 0x20) // Store the return offset.\n // End the transaction, returning the string.\n return(retStart, and(not(0x1f), add(0x1f, retUnpaddedSize)))\n }\n }\n}\n"},{"file_path":"src/Dependencies/LiquityMath.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity 0.8.24;\n\nimport {DECIMAL_PRECISION} from \"./Constants.sol\";\n\nlibrary LiquityMath {\n function _min(uint256 _a, uint256 _b) internal pure returns (uint256) {\n return (_a < _b) ? _a : _b;\n }\n\n function _max(uint256 _a, uint256 _b) internal pure returns (uint256) {\n return (_a >= _b) ? _a : _b;\n }\n\n function _sub_min_0(uint256 _a, uint256 _b) internal pure returns (uint256) {\n return (_a > _b) ? _a - _b : 0;\n }\n\n /* \n * Multiply two decimal numbers and use normal rounding rules:\n * -round product up if 19'th mantissa digit >= 5\n * -round product down if 19'th mantissa digit < 5\n *\n * Used only inside the exponentiation, _decPow().\n */\n function decMul(uint256 x, uint256 y) internal pure returns (uint256 decProd) {\n uint256 prod_xy = x * y;\n\n decProd = (prod_xy + DECIMAL_PRECISION / 2) / DECIMAL_PRECISION;\n }\n\n /* \n * _decPow: Exponentiation function for 18-digit decimal base, and integer exponent n.\n * \n * Uses the efficient \"exponentiation by squaring\" algorithm. O(log(n)) complexity. \n * \n * Called by function CollateralRegistry._calcDecayedBaseRate, that represent time in units of minutes\n *\n * The exponent is capped to avoid reverting due to overflow. The cap 525600000 equals\n * \"minutes in 1000 years\": 60 * 24 * 365 * 1000\n * \n * If a period of > 1000 years is ever used as an exponent in either of the above functions, the result will be\n * negligibly different from just passing the cap, since: \n *\n * In function 1), the decayed base rate will be 0 for 1000 years or > 1000 years\n * In function 2), the difference in tokens issued at 1000 years and any time > 1000 years, will be negligible\n */\n function _decPow(uint256 _base, uint256 _minutes) internal pure returns (uint256) {\n if (_minutes > 525600000) _minutes = 525600000; // cap to avoid overflow\n\n if (_minutes == 0) return DECIMAL_PRECISION;\n\n uint256 y = DECIMAL_PRECISION;\n uint256 x = _base;\n uint256 n = _minutes;\n\n // Exponentiation-by-squaring\n while (n > 1) {\n if (n % 2 == 0) {\n x = decMul(x, x);\n n = n / 2;\n } else {\n // if (n % 2 != 0)\n y = decMul(x, y);\n x = decMul(x, x);\n n = (n - 1) / 2;\n }\n }\n\n return decMul(x, y);\n }\n\n function _getAbsoluteDifference(uint256 _a, uint256 _b) internal pure returns (uint256) {\n return (_a >= _b) ? _a - _b : _b - _a;\n }\n\n function _computeCR(uint256 _coll, uint256 _debt, uint256 _price) internal pure returns (uint256) {\n if (_debt > 0) {\n uint256 newCollRatio = _coll * _price / _debt;\n\n return newCollRatio;\n }\n // Return the maximal value for uint256 if the debt is 0. Represents \"infinite\" CR.\n else {\n // if (_debt == 0)\n return 2 ** 256 - 1;\n }\n }\n}\n"},{"file_path":"src/Interfaces/IBorrowerOperations.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"./ILiquityBase.sol\";\nimport \"./IAddRemoveManagers.sol\";\nimport \"./IBoldToken.sol\";\nimport \"./IPriceFeed.sol\";\nimport \"./ISortedTroves.sol\";\nimport \"./ITroveManager.sol\";\nimport \"./IWETH.sol\";\n\n// Common interface for the Borrower Operations.\ninterface IBorrowerOperations is ILiquityBase, IAddRemoveManagers {\n function CCR() external view returns (uint256);\n function MCR() external view returns (uint256);\n function SCR() external view returns (uint256);\n\n function openTrove(\n address _owner,\n uint256 _ownerIndex,\n uint256 _ETHAmount,\n uint256 _boldAmount,\n uint256 _upperHint,\n uint256 _lowerHint,\n uint256 _annualInterestRate,\n uint256 _maxUpfrontFee,\n address _addManager,\n address _removeManager,\n address _receiver\n ) external returns (uint256);\n\n struct OpenTroveAndJoinInterestBatchManagerParams {\n address owner;\n uint256 ownerIndex;\n uint256 collAmount;\n uint256 boldAmount;\n uint256 upperHint;\n uint256 lowerHint;\n address interestBatchManager;\n uint256 maxUpfrontFee;\n address addManager;\n address removeManager;\n address receiver;\n }\n\n function openTroveAndJoinInterestBatchManager(OpenTroveAndJoinInterestBatchManagerParams calldata _params)\n external\n returns (uint256);\n\n function addColl(uint256 _troveId, uint256 _ETHAmount) external;\n\n function withdrawColl(uint256 _troveId, uint256 _amount) external;\n\n function withdrawBold(uint256 _troveId, uint256 _amount, uint256 _maxUpfrontFee) external;\n\n function repayBold(uint256 _troveId, uint256 _amount) external;\n\n function closeTrove(uint256 _troveId) external;\n\n function adjustTrove(\n uint256 _troveId,\n uint256 _collChange,\n bool _isCollIncrease,\n uint256 _debtChange,\n bool isDebtIncrease,\n uint256 _maxUpfrontFee\n ) external;\n\n function adjustZombieTrove(\n uint256 _troveId,\n uint256 _collChange,\n bool _isCollIncrease,\n uint256 _boldChange,\n bool _isDebtIncrease,\n uint256 _upperHint,\n uint256 _lowerHint,\n uint256 _maxUpfrontFee\n ) external;\n\n function adjustTroveInterestRate(\n uint256 _troveId,\n uint256 _newAnnualInterestRate,\n uint256 _upperHint,\n uint256 _lowerHint,\n uint256 _maxUpfrontFee\n ) external;\n\n function applyPendingDebt(uint256 _troveId, uint256 _lowerHint, uint256 _upperHint) external;\n\n function onLiquidateTrove(uint256 _troveId) external;\n\n function claimCollateral() external;\n\n function hasBeenShutDown() external view returns (bool);\n function shutdown() external;\n function shutdownFromOracleFailure() external;\n\n function checkBatchManagerExists(address _batchMananger) external view returns (bool);\n\n // -- individual delegation --\n struct InterestIndividualDelegate {\n address account;\n uint128 minInterestRate;\n uint128 maxInterestRate;\n uint256 minInterestRateChangePeriod;\n }\n\n function getInterestIndividualDelegateOf(uint256 _troveId)\n external\n view\n returns (InterestIndividualDelegate memory);\n function setInterestIndividualDelegate(\n uint256 _troveId,\n address _delegate,\n uint128 _minInterestRate,\n uint128 _maxInterestRate,\n // only needed if trove was previously in a batch:\n uint256 _newAnnualInterestRate,\n uint256 _upperHint,\n uint256 _lowerHint,\n uint256 _maxUpfrontFee,\n uint256 _minInterestRateChangePeriod\n ) external;\n function removeInterestIndividualDelegate(uint256 _troveId) external;\n\n // -- batches --\n struct InterestBatchManager {\n uint128 minInterestRate;\n uint128 maxInterestRate;\n uint256 minInterestRateChangePeriod;\n }\n\n function registerBatchManager(\n uint128 minInterestRate,\n uint128 maxInterestRate,\n uint128 currentInterestRate,\n uint128 fee,\n uint128 minInterestRateChangePeriod\n ) external;\n function lowerBatchManagementFee(uint256 _newAnnualFee) external;\n function setBatchManagerAnnualInterestRate(\n uint128 _newAnnualInterestRate,\n uint256 _upperHint,\n uint256 _lowerHint,\n uint256 _maxUpfrontFee\n ) external;\n function interestBatchManagerOf(uint256 _troveId) external view returns (address);\n function getInterestBatchManager(address _account) external view returns (InterestBatchManager memory);\n function setInterestBatchManager(\n uint256 _troveId,\n address _newBatchManager,\n uint256 _upperHint,\n uint256 _lowerHint,\n uint256 _maxUpfrontFee\n ) external;\n function kickFromBatch(uint256 _troveId, uint256 _upperHint, uint256 _lowerHint) external;\n function removeFromBatch(\n uint256 _troveId,\n uint256 _newAnnualInterestRate,\n uint256 _upperHint,\n uint256 _lowerHint,\n uint256 _maxUpfrontFee\n ) external;\n function switchBatchManager(\n uint256 _troveId,\n uint256 _removeUpperHint,\n uint256 _removeLowerHint,\n address _newBatchManager,\n uint256 _addUpperHint,\n uint256 _addLowerHint,\n uint256 _maxUpfrontFee\n ) external;\n}\n"},{"file_path":"src/Interfaces/ICollateralRegistry.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol\";\nimport \"./IBoldToken.sol\";\nimport \"./ITroveManager.sol\";\n\ninterface ICollateralRegistry {\n function baseRate() external view returns (uint256);\n function lastFeeOperationTime() external view returns (uint256);\n\n function redeemCollateral(uint256 _boldamount, uint256 _maxIterations, uint256 _maxFeePercentage) external;\n // getters\n function totalCollaterals() external view returns (uint256);\n function getToken(uint256 _index) external view returns (IERC20Metadata);\n function getTroveManager(uint256 _index) external view returns (ITroveManager);\n function getNonRedeemableToken(uint256 _index) external view returns(IERC20Metadata);\n function getNonRedeemableTroveManager(uint256 _index) external view returns(ITroveManager);\n function getTroveManagers() external view returns(ITroveManager[] memory);\n function getNonRedeemableTroveManagers() external view returns(ITroveManager[] memory);\n function boldToken() external view returns (IBoldToken);\n function getRedemptionRate() external view returns (uint256);\n function getRedemptionRateWithDecay() external view returns (uint256);\n function getRedemptionRateForRedeemedAmount(uint256 _redeemAmount) external view returns (uint256);\n\n function getRedemptionFeeWithDecay(uint256 _ETHDrawn) external view returns (uint256);\n function getEffectiveRedemptionFeeInBold(uint256 _redeemAmount) external view returns (uint256);\n\n function updateDebtLimit(uint256 _indexTroveManager, uint256 _newDebtLimit) external;\n function updateNonRedeemableDebtLimit(uint256 _indexTroveManager, uint256 _newDebtLimit) external;\n function proposeGovernor(address _newGovernor) external;\n function acceptGovernor() external;\n function cancelGovernorProposal() external;\n function pendingGovernor() external view returns (address);\n function pendingGovernorTimestamp() external view returns (uint256);\n function getDebtLimit(uint256 _indexTroveManager) external view returns (uint256); \n function getNonRedeemableDebtLimit(uint256 _indexTroveManager) external view returns (uint256);\n}\n"},{"file_path":"src/NFTMetadata/MetadataNFT.sol","source_code":"//SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport \"Solady/utils/SSTORE2.sol\";\nimport \"./utils/JSON.sol\";\n\nimport \"./utils/baseSVG.sol\";\nimport \"./utils/bauhaus.sol\";\n\nimport \"openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol\";\n\nimport {ITroveManager} from \"../Interfaces/ITroveManager.sol\";\n\ninterface IMetadataNFT {\n struct TroveData {\n uint256 _tokenId;\n address _owner;\n address _collToken;\n address _boldToken;\n uint256 _collAmount;\n uint256 _debtAmount;\n uint256 _interestRate;\n ITroveManager.Status _status;\n }\n\n function uri(TroveData memory _troveData) external view returns (string memory);\n}\n\ncontract MetadataNFT is IMetadataNFT {\n FixedAssetReader public immutable assetReader;\n\n constructor(FixedAssetReader _assetReader) {\n assetReader = _assetReader;\n }\n\n function uri(TroveData memory _troveData) public view returns (string memory) {\n string memory attr = attributes(_troveData);\n return json.formattedMetadata(\n string.concat(\"Base Dollar - \", IERC20Metadata(_troveData._collToken).name()),\n string.concat(\n \"Base Dollar is a collateralized debt platform. Users can lock up \",\n IERC20Metadata(_troveData._collToken).symbol(),\n \" to issue stablecoin tokens (BD) to their own Ethereum address. The individual collateralized debt positions are called Troves, and are represented as NFTs.\"\n ),\n renderSVGImage(_troveData),\n attr\n );\n }\n\n function renderSVGImage(TroveData memory _troveData) internal view returns (string memory) {\n return svg._svg(\n baseSVG._svgProps(),\n string.concat(\n baseSVG._baseElements(assetReader),\n bauhaus._bauhaus(IERC20Metadata(_troveData._collToken).symbol(), _troveData._tokenId),\n dynamicTextComponents(_troveData)\n )\n );\n }\n\n function attributes(TroveData memory _troveData) public pure returns (string memory) {\n //include: collateral token address, collateral amount, debt token address, debt amount, interest rate, status\n return string.concat(\n '[{\"trait_type\": \"Collateral Token\", \"value\": \"',\n LibString.toHexString(_troveData._collToken),\n '\"}, {\"trait_type\": \"Collateral Amount\", \"value\": \"',\n LibString.toString(_troveData._collAmount),\n '\"}, {\"trait_type\": \"Debt Token\", \"value\": \"',\n LibString.toHexString(_troveData._boldToken),\n '\"}, {\"trait_type\": \"Debt Amount\", \"value\": \"',\n LibString.toString(_troveData._debtAmount),\n '\"}, {\"trait_type\": \"Interest Rate\", \"value\": \"',\n LibString.toString(_troveData._interestRate),\n '\"}, {\"trait_type\": \"Status\", \"value\": \"',\n _status2Str(_troveData._status),\n '\"} ]'\n );\n }\n\n function dynamicTextComponents(TroveData memory _troveData) public view returns (string memory) {\n string memory id = LibString.toHexString(_troveData._tokenId);\n id = string.concat(LibString.slice(id, 0, 6), \"...\", LibString.slice(id, 38, 42));\n\n return string.concat(\n baseSVG._formattedIdEl(id),\n baseSVG._formattedAddressEl(_troveData._owner),\n baseSVG._collLogo(IERC20Metadata(_troveData._collToken).symbol(), assetReader),\n baseSVG._statusEl(_status2Str(_troveData._status)),\n baseSVG._dynamicTextEls(_troveData._debtAmount, _troveData._collAmount, _troveData._interestRate)\n );\n }\n\n function _status2Str(ITroveManager.Status status) internal pure returns (string memory) {\n if (status == ITroveManager.Status.active) return \"Active\";\n if (status == ITroveManager.Status.closedByOwner) return \"Closed\";\n if (status == ITroveManager.Status.closedByLiquidation) return \"Liquidated\";\n if (status == ITroveManager.Status.zombie) return \"Below Min Debt\";\n return \"\";\n }\n}\n"},{"file_path":"src/Interfaces/IAddRemoveManagers.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\ninterface IAddRemoveManagers {\n function setAddManager(uint256 _troveId, address _manager) external;\n function setRemoveManager(uint256 _troveId, address _manager) external;\n function setRemoveManagerWithReceiver(uint256 _troveId, address _manager, address _receiver) external;\n function addManagerOf(uint256 _troveId) external view returns (address);\n function removeManagerReceiverOf(uint256 _troveId) external view returns (address, address);\n}\n"},{"file_path":"lib/openzeppelin-contracts/contracts/utils/introspection/IERC165.sol","source_code":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (utils/introspection/IERC165.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev Interface of the ERC165 standard, as defined in the\n * https://eips.ethereum.org/EIPS/eip-165[EIP].\n *\n * Implementers can declare support of contract interfaces, which can then be\n * queried by others ({ERC165Checker}).\n *\n * For an implementation, see {ERC165}.\n */\ninterface IERC165 {\n /**\n * @dev Returns true if this contract implements the interface defined by\n * `interfaceId`. See the corresponding\n * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[EIP section]\n * to learn more about how these ids are created.\n *\n * This function call must use less than 30 000 gas.\n */\n function supportsInterface(bytes4 interfaceId) external view returns (bool);\n}\n"},{"file_path":"src/NFTMetadata/utils/bauhaus.sol","source_code":"//SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport \"./SVG.sol\";\n\nlibrary bauhaus {\n string constant GOLDEN = \"#F5D93A\";\n string constant CORAL = \"#FB7C59\";\n string constant GREEN = \"#63D77D\";\n string constant CYAN = \"#95CBF3\";\n string constant BLUE = \"#405AE5\";\n string constant DARK_BLUE = \"#121B44\";\n string constant BROWN = \"#D99664\";\n\n enum colorCode {\n GOLDEN,\n CORAL,\n GREEN,\n CYAN,\n BLUE,\n DARK_BLUE,\n BROWN\n }\n\n function _bauhaus(string memory _collName, uint256 _troveId) internal pure returns (string memory) {\n bytes32 collSig = keccak256(bytes(_collName));\n uint256 variant = _troveId % 4;\n\n if (collSig == keccak256(\"WETH\")) {\n return _img1(variant);\n } else if (collSig == keccak256(\"wstETH\")) {\n return _img2(variant);\n } else {\n // assume rETH\n return _img3(variant);\n }\n }\n\n function _colorCode2Hex(colorCode _color) private pure returns (string memory) {\n if (_color == colorCode.GOLDEN) {\n return GOLDEN;\n } else if (_color == colorCode.CORAL) {\n return CORAL;\n } else if (_color == colorCode.GREEN) {\n return GREEN;\n } else if (_color == colorCode.CYAN) {\n return CYAN;\n } else if (_color == colorCode.BLUE) {\n return BLUE;\n } else if (_color == colorCode.DARK_BLUE) {\n return DARK_BLUE;\n } else {\n return BROWN;\n }\n }\n\n struct COLORS {\n colorCode rect1;\n colorCode rect2;\n colorCode rect3;\n colorCode rect4;\n colorCode rect5;\n colorCode poly;\n colorCode circle1;\n colorCode circle2;\n colorCode circle3;\n }\n\n function _colors1(uint256 _variant) internal pure returns (COLORS memory) {\n if (_variant == 0) {\n return COLORS(\n colorCode.BLUE, // rect1\n colorCode.GOLDEN, // rect2\n colorCode.GOLDEN, // rect3\n colorCode.BROWN, // rect4\n colorCode.CORAL, // rect5\n colorCode.CYAN, // poly\n colorCode.GREEN, // circle1\n colorCode.DARK_BLUE, // circle2\n colorCode.GOLDEN // circle3\n );\n } else if (_variant == 1) {\n return COLORS(\n colorCode.GREEN, // rect1\n colorCode.BLUE, // rect2\n colorCode.GOLDEN, // rect3\n colorCode.BROWN, // rect4\n colorCode.GOLDEN, // rect5\n colorCode.CORAL, // poly\n colorCode.BLUE, // circle1\n colorCode.DARK_BLUE, // circle2\n colorCode.BLUE // circle3\n );\n } else if (_variant == 2) {\n return COLORS(\n colorCode.BLUE, // rect1\n colorCode.GOLDEN, // rect2\n colorCode.CYAN, // rect3\n colorCode.GOLDEN, // rect4\n colorCode.BROWN, // rect5\n colorCode.GREEN, // poly\n colorCode.CORAL, // circle1\n colorCode.DARK_BLUE, // circle2\n colorCode.BROWN // circle3\n );\n } else {\n return COLORS(\n colorCode.CYAN, // rect1\n colorCode.BLUE, // rect2\n colorCode.BLUE, // rect3\n colorCode.BROWN, // rect4\n colorCode.BLUE, // rect5\n colorCode.GREEN, // poly\n colorCode.GOLDEN, // circle1\n colorCode.DARK_BLUE, // circle2\n colorCode.BLUE // circle3\n );\n }\n }\n\n function _img1(uint256 _variant) internal pure returns (string memory) {\n COLORS memory colors = _colors1(_variant);\n return string.concat(_rects1(colors), _polygons1(colors), _circles1(colors));\n }\n\n function _rects1(COLORS memory _colors) internal pure returns (string memory) {\n return string.concat(\n //background\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"55\"),\n svg.prop(\"width\", \"268\"),\n svg.prop(\"height\", \"268\"),\n svg.prop(\"fill\", DARK_BLUE)\n )\n ),\n // large right rect | rect1\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"128\"),\n svg.prop(\"y\", \"55\"),\n svg.prop(\"width\", \"156\"),\n svg.prop(\"height\", \"268\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect1))\n )\n ),\n // small upper right rect | rect2\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"228\"),\n svg.prop(\"y\", \"55\"),\n svg.prop(\"width\", \"56\"),\n svg.prop(\"height\", \"56\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect2))\n )\n ),\n // large central left rect | rect3\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"111\"),\n svg.prop(\"width\", \"134\"),\n svg.prop(\"height\", \"156\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect3))\n )\n ),\n // small lower left rect | rect4\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"267\"),\n svg.prop(\"width\", \"112\"),\n svg.prop(\"height\", \"56\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect4))\n )\n ),\n // small lower right rect | rect5\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"228\"),\n svg.prop(\"y\", \"267\"),\n svg.prop(\"width\", \"56\"),\n svg.prop(\"height\", \"56\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect5))\n )\n )\n );\n }\n\n function _polygons1(COLORS memory _colors) internal pure returns (string memory) {\n return string.concat(\n // left triangle | poly1\n svg.polygon(\n string.concat(svg.prop(\"points\", \"16,55 72,55 16,111\"), svg.prop(\"fill\", _colorCode2Hex(_colors.poly)))\n ),\n // right triangle | poly2\n svg.polygon(\n string.concat(svg.prop(\"points\", \"72,55 128,55 72,111\"), svg.prop(\"fill\", _colorCode2Hex(_colors.poly)))\n )\n );\n }\n\n function _circles1(COLORS memory _colors) internal pure returns (string memory) {\n return string.concat(\n //large central circle | circle1\n svg.circle(\n string.concat(\n svg.prop(\"cx\", \"150\"),\n svg.prop(\"cy\", \"189\"),\n svg.prop(\"r\", \"78\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.circle1))\n )\n ),\n //small right circle | circle2\n svg.circle(\n string.concat(\n svg.prop(\"cx\", \"228\"),\n svg.prop(\"cy\", \"295\"),\n svg.prop(\"r\", \"28\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.circle2))\n )\n ),\n //small right half circle | circle3\n svg.path(\n \"M228 267C220.574 267 213.452 269.95 208.201 275.201C202.95 280.452 200 287.574 200 295C200 302.426 202.95 309.548 208.201 314.799C213.452 320.05 220.574 323 228 323L228 267Z\",\n svg.prop(\"fill\", _colorCode2Hex(_colors.circle3))\n )\n );\n }\n\n function _colors2(uint256 _variant) internal pure returns (COLORS memory) {\n if (_variant == 0) {\n return COLORS(\n colorCode.BROWN, // rect1\n colorCode.GOLDEN, // rect2\n colorCode.BLUE, // rect3\n colorCode.GREEN, // rect4\n colorCode.CORAL, // rect5\n colorCode.GOLDEN, // unused\n colorCode.GOLDEN, // circle1\n colorCode.CYAN, // circle2\n colorCode.GREEN // circle3\n );\n } else if (_variant == 1) {\n return COLORS(\n colorCode.GREEN, // rect1\n colorCode.BROWN, // rect2\n colorCode.GOLDEN, // rect3\n colorCode.BLUE, // rect4\n colorCode.CYAN, // rect5\n colorCode.GOLDEN, // unused\n colorCode.GREEN, // circle1\n colorCode.CORAL, // circle2\n colorCode.BLUE // circle3\n );\n } else if (_variant == 2) {\n return COLORS(\n colorCode.BLUE, // rect1\n colorCode.GOLDEN, // rect2\n colorCode.GREEN, // rect3\n colorCode.BLUE, // rect4\n colorCode.CORAL, // rect5\n colorCode.GOLDEN, // unused\n colorCode.CYAN, // circle1\n colorCode.BROWN, // circle2\n colorCode.BROWN // circle3\n );\n } else {\n return COLORS(\n colorCode.GOLDEN, // rect1\n colorCode.GREEN, // rect2\n colorCode.BLUE, // rect3\n colorCode.GOLDEN, // rect4\n colorCode.BROWN, // rect5\n colorCode.GOLDEN, // unused\n colorCode.BROWN, // circle1\n colorCode.CYAN, // circle2\n colorCode.CORAL // circle3\n );\n }\n }\n\n function _img2(uint256 _variant) internal pure returns (string memory) {\n COLORS memory colors = _colors2(_variant);\n return string.concat(_rects2(colors), _circles2(colors));\n }\n\n function _rects2(COLORS memory _colors) internal pure returns (string memory) {\n return string.concat(\n //background\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"55\"),\n svg.prop(\"width\", \"268\"),\n svg.prop(\"height\", \"268\"),\n svg.prop(\"fill\", DARK_BLUE)\n )\n ),\n // large upper right rect | rect1\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"128\"),\n svg.prop(\"y\", \"55\"),\n svg.prop(\"width\", \"156\"),\n svg.prop(\"height\", \"156\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect1))\n )\n ),\n // large central left rect | rect2\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"111\"),\n svg.prop(\"width\", \"134\"),\n svg.prop(\"height\", \"100\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect2))\n )\n ),\n // large lower left rect | rect3\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"211\"),\n svg.prop(\"width\", \"212\"),\n svg.prop(\"height\", \"56\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect3))\n )\n ),\n // small lower central rect | rect4\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"72\"),\n svg.prop(\"y\", \"267\"),\n svg.prop(\"width\", \"78\"),\n svg.prop(\"height\", \"56\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect4))\n )\n ),\n // small lower right rect | rect5\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"150\"),\n svg.prop(\"y\", \"267\"),\n svg.prop(\"width\", \"134\"),\n svg.prop(\"height\", \"56\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect5))\n )\n )\n );\n }\n\n function _circles2(COLORS memory _colors) internal pure returns (string memory) {\n return string.concat(\n //lower left circle | circle1\n svg.circle(\n string.concat(\n svg.prop(\"cx\", \"44\"),\n svg.prop(\"cy\", \"295\"),\n svg.prop(\"r\", \"28\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.circle1))\n )\n ),\n //upper left half circle | circle2\n svg.path(\n \"M16 55C16 62.4 17.4 69.6 20.3 76.4C23.1 83.2 27.2 89.4 32.4 94.6C37.6 99.8 43.8 103.9 50.6 106.7C57.4 109.6 64.6 111 72 111C79.4 111 86.6 109.6 93.4 106.7C100.2 103.9 106.4 99.8 111.6 94.6C116.8 89.4 120.9 83.2 123.7 76.4C126.6 69.6 128 62.4 128 55L16 55Z\",\n svg.prop(\"fill\", _colorCode2Hex(_colors.circle2))\n ),\n //central right half circle | circle3\n svg.path(\n \"M284 211C284 190.3 275.8 170.5 261.2 155.8C246.5 141.2 226.7 133 206 133C185.3 133 165.5 141.2 150.9 155.86C136.2 170.5 128 190.3 128 211L284 211Z\",\n svg.prop(\"fill\", _colorCode2Hex(_colors.circle3))\n )\n );\n }\n\n function _colors3(uint256 _variant) internal pure returns (COLORS memory) {\n if (_variant == 0) {\n return COLORS(\n colorCode.BLUE, // rect1\n colorCode.CORAL, // rect2\n colorCode.BLUE, // rect3\n colorCode.GREEN, // rect4\n colorCode.GOLDEN, // unused\n colorCode.GOLDEN, // unused\n colorCode.GOLDEN, // circle1\n colorCode.CYAN, // circle2\n colorCode.GOLDEN // circle3\n );\n } else if (_variant == 1) {\n return COLORS(\n colorCode.CORAL, // rect1\n colorCode.GREEN, // rect2\n colorCode.BROWN, // rect3\n colorCode.GOLDEN, // rect4\n colorCode.GOLDEN, // unused\n colorCode.GOLDEN, // unused\n colorCode.BLUE, // circle1\n colorCode.BLUE, // circle2\n colorCode.CYAN // circle3\n );\n } else if (_variant == 2) {\n return COLORS(\n colorCode.CORAL, // rect1\n colorCode.CYAN, // rect2\n colorCode.CORAL, // rect3\n colorCode.GOLDEN, // rect4\n colorCode.GOLDEN, // unused\n colorCode.GOLDEN, // unused\n colorCode.GREEN, // circle1\n colorCode.BLUE, // circle2\n colorCode.GREEN // circle3\n );\n } else {\n return COLORS(\n colorCode.GOLDEN, // rect1\n colorCode.CORAL, // rect2\n colorCode.GREEN, // rect3\n colorCode.BLUE, // rect4\n colorCode.GOLDEN, // unused\n colorCode.GOLDEN, // unused\n colorCode.BROWN, // circle1\n colorCode.BLUE, // circle2\n colorCode.GREEN // circle3\n );\n }\n }\n\n function _img3(uint256 _variant) internal pure returns (string memory) {\n COLORS memory colors = _colors3(_variant);\n return string.concat(_rects3(colors), _circles3(colors));\n }\n\n function _rects3(COLORS memory _colors) internal pure returns (string memory) {\n return string.concat(\n //background\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"55\"),\n svg.prop(\"width\", \"268\"),\n svg.prop(\"height\", \"268\"),\n svg.prop(\"fill\", DARK_BLUE)\n )\n ),\n // lower left rect | rect1\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"205\"),\n svg.prop(\"width\", \"75\"),\n svg.prop(\"height\", \"118\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect1))\n )\n ),\n // central rect | rect2\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"91\"),\n svg.prop(\"y\", \"205\"),\n svg.prop(\"width\", \"136\"),\n svg.prop(\"height\", \"59\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect2))\n )\n ),\n // central right rect | rect3\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"166\"),\n svg.prop(\"y\", \"180\"),\n svg.prop(\"width\", \"118\"),\n svg.prop(\"height\", \"25\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect3))\n )\n ),\n // upper right rect | rect4\n svg.rect(\n string.concat(\n svg.prop(\"x\", \"166\"),\n svg.prop(\"y\", \"55\"),\n svg.prop(\"width\", \"118\"),\n svg.prop(\"height\", \"126\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.rect4))\n )\n )\n );\n }\n\n function _circles3(COLORS memory _colors) internal pure returns (string memory) {\n return string.concat(\n //upper left circle | circle1\n svg.circle(\n string.concat(\n svg.prop(\"cx\", \"91\"),\n svg.prop(\"cy\", \"130\"),\n svg.prop(\"r\", \"75\"),\n svg.prop(\"fill\", _colorCode2Hex(_colors.circle1))\n )\n ),\n //upper right half circle | circle2\n svg.path(\n \"M284 264 166 264 166 263C166 232 193 206 225 205C258 206 284 232 284 264C284 264 284 264 284 264Z\",\n svg.prop(\"fill\", _colorCode2Hex(_colors.circle2))\n ),\n //lower right half circle | circle3\n svg.path(\n \"M284 323 166 323 166 323C166 290 193 265 225 264C258 265 284 290 284 323C284 323 284 323 284 323Z\",\n svg.prop(\"fill\", _colorCode2Hex(_colors.circle3))\n )\n );\n }\n}\n"},{"file_path":"src/Types/LatestTroveData.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity 0.8.24;\n\nstruct LatestTroveData {\n uint256 entireDebt;\n uint256 entireColl;\n uint256 redistBoldDebtGain;\n uint256 redistCollGain;\n uint256 accruedInterest;\n uint256 recordedDebt;\n uint256 annualInterestRate;\n uint256 weightedRecordedDebt;\n uint256 accruedBatchManagementFee;\n uint256 lastInterestRateAdjTime;\n}\n"},{"file_path":"src/NFTMetadata/utils/FixedAssets.sol","source_code":"//SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport \"Solady/utils/SSTORE2.sol\";\n\ncontract FixedAssetReader {\n struct Asset {\n uint128 start;\n uint128 end;\n }\n\n address public immutable pointer;\n\n mapping(bytes4 => Asset) public assets;\n\n function readAsset(bytes4 _sig) public view returns (string memory) {\n return string(SSTORE2.read(pointer, uint256(assets[_sig].start), uint256(assets[_sig].end)));\n }\n\n constructor(address _pointer, bytes4[] memory _sigs, Asset[] memory _assets) {\n pointer = _pointer;\n require(_sigs.length == _assets.length, \"FixedAssetReader: Invalid input\");\n for (uint256 i = 0; i < _sigs.length; i++) {\n assets[_sigs[i]] = _assets[i];\n }\n }\n}\n"},{"file_path":"lib/openzeppelin-contracts/contracts/token/ERC20/IERC20.sol","source_code":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC20/IERC20.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev Interface of the ERC20 standard as defined in the EIP.\n */\ninterface IERC20 {\n /**\n * @dev Emitted when `value` tokens are moved from one account (`from`) to\n * another (`to`).\n *\n * Note that `value` may be zero.\n */\n event Transfer(address indexed from, address indexed to, uint256 value);\n\n /**\n * @dev Emitted when the allowance of a `spender` for an `owner` is set by\n * a call to {approve}. `value` is the new allowance.\n */\n event Approval(address indexed owner, address indexed spender, uint256 value);\n\n /**\n * @dev Returns the amount of tokens in existence.\n */\n function totalSupply() external view returns (uint256);\n\n /**\n * @dev Returns the amount of tokens owned by `account`.\n */\n function balanceOf(address account) external view returns (uint256);\n\n /**\n * @dev Moves `amount` tokens from the caller's account to `to`.\n *\n * Returns a boolean value indicating whether the operation succeeded.\n *\n * Emits a {Transfer} event.\n */\n function transfer(address to, uint256 amount) external returns (bool);\n\n /**\n * @dev Returns the remaining number of tokens that `spender` will be\n * allowed to spend on behalf of `owner` through {transferFrom}. This is\n * zero by default.\n *\n * This value changes when {approve} or {transferFrom} are called.\n */\n function allowance(address owner, address spender) external view returns (uint256);\n\n /**\n * @dev Sets `amount` as the allowance of `spender` over the caller's tokens.\n *\n * Returns a boolean value indicating whether the operation succeeded.\n *\n * IMPORTANT: Beware that changing an allowance with this method brings the risk\n * that someone may use both the old and the new allowance by unfortunate\n * transaction ordering. One possible solution to mitigate this race\n * condition is to first reduce the spender's allowance to 0 and set the\n * desired value afterwards:\n * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\n *\n * Emits an {Approval} event.\n */\n function approve(address spender, uint256 amount) external returns (bool);\n\n /**\n * @dev Moves `amount` tokens from `from` to `to` using the\n * allowance mechanism. `amount` is then deducted from the caller's\n * allowance.\n *\n * Returns a boolean value indicating whether the operation succeeded.\n *\n * Emits a {Transfer} event.\n */\n function transferFrom(address from, address to, uint256 amount) external returns (bool);\n}\n"},{"file_path":"src/Interfaces/IMultiTroveGetter.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\ninterface IMultiTroveGetter {\n struct CombinedTroveData {\n uint256 id;\n uint256 entireDebt;\n uint256 entireColl;\n uint256 redistBoldDebtGain;\n uint256 redistCollGain;\n uint256 accruedInterest;\n uint256 recordedDebt;\n uint256 annualInterestRate;\n uint256 accruedBatchManagementFee;\n uint256 lastInterestRateAdjTime;\n uint256 stake;\n uint256 lastDebtUpdateTime;\n address interestBatchManager;\n uint256 batchDebtShares;\n uint256 snapshotETH;\n uint256 snapshotBoldDebt;\n }\n\n struct DebtPerInterestRate {\n address interestBatchManager;\n uint256 interestRate;\n uint256 debt;\n }\n\n function getMultipleSortedTroves(uint256 _collIndex, int256 _startIdx, uint256 _count)\n external\n view\n returns (CombinedTroveData[] memory _troves);\n\n function getDebtPerInterestRateAscending(uint256 _collIndex, uint256 _startId, uint256 _maxIterations)\n external\n view\n returns (DebtPerInterestRate[] memory, uint256 currId);\n}\n"},{"file_path":"src/Interfaces/IBoldRewardsReceiver.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\ninterface IBoldRewardsReceiver {\n function triggerBoldRewards(uint256 _boldYield) external;\n}\n"},{"file_path":"src/NFTMetadata/utils/baseSVG.sol","source_code":"//SPDX-License-Identifier: MIT\npragma solidity 0.8.24;\n\nimport {svg} from \"./SVG.sol\";\nimport {utils, LibString, numUtils} from \"./Utils.sol\";\nimport \"./FixedAssets.sol\";\n\nlibrary baseSVG {\n string constant GEIST = 'style=\"font-family: Geist\" ';\n string constant DARK_BLUE = \"#121B44\";\n string constant STOIC_WHITE = \"#DEE4FB\";\n\n function _svgProps() internal pure returns (string memory) {\n return string.concat(\n svg.prop(\"width\", \"300\"),\n svg.prop(\"height\", \"484\"),\n svg.prop(\"viewBox\", \"0 0 300 484\"),\n svg.prop(\"style\", \"background:none\")\n );\n }\n\n function _baseElements(FixedAssetReader _assetReader) internal view returns (string memory) {\n return string.concat(\n svg.rect(\n string.concat(\n svg.prop(\"fill\", DARK_BLUE),\n svg.prop(\"rx\", \"8\"),\n svg.prop(\"width\", \"300\"),\n svg.prop(\"height\", \"484\")\n )\n ),\n _styles(_assetReader),\n _leverageLogo(),\n _boldLogo(_assetReader),\n _staticTextEls()\n );\n }\n\n function _styles(FixedAssetReader _assetReader) private view returns (string memory) {\n return svg.el(\n \"style\",\n utils.NULL,\n string.concat(\n '@font-face { font-family: \"Geist\"; src: url(\"data:font/woff2;utf-8;base64,',\n _assetReader.readAsset(bytes4(keccak256(\"geist\"))),\n '\"); }'\n )\n );\n }\n\n function _leverageLogo() internal pure returns (string memory) {\n return string.concat(\n svg.path(\n \"M20.2 31.2C19.1 32.4 17.6 33 16 33L16 21C17.6 21 19.1 21.6 20.2 22.7C21.4 23.9 22 25.4 22 27C22 28.6 21.4 30.1 20.2 31.2Z\",\n svg.prop(\"fill\", STOIC_WHITE)\n ),\n svg.path(\n \"M22 27C22 25.4 22.6 23.9 23.8 22.7C25 21.6 26.4 21 28 21V33C26.4 33 25 32.4 24 31.2C22.6 30.1 22 28.6 22 27Z\",\n svg.prop(\"fill\", STOIC_WHITE)\n )\n );\n }\n\n function _boldLogo(FixedAssetReader _assetReader) internal view returns (string memory) {\n return svg.el(\n \"image\",\n string.concat(\n svg.prop(\"x\", \"264\"),\n svg.prop(\"y\", \"373.5\"),\n svg.prop(\"width\", \"20\"),\n svg.prop(\"height\", \"20\"),\n svg.prop(\n \"href\",\n string.concat(\"data:image/svg+xml;base64,\", _assetReader.readAsset(bytes4(keccak256(\"BOLD\"))))\n )\n )\n );\n }\n\n function _staticTextEls() internal pure returns (string memory) {\n return string.concat(\n svg.text(\n string.concat(\n GEIST,\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"358\"),\n svg.prop(\"font-size\", \"14\"),\n svg.prop(\"fill\", \"white\")\n ),\n \"Collateral\"\n ),\n svg.text(\n string.concat(\n GEIST,\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"389\"),\n svg.prop(\"font-size\", \"14\"),\n svg.prop(\"fill\", \"white\")\n ),\n \"Debt\"\n ),\n svg.text(\n string.concat(\n GEIST,\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"420\"),\n svg.prop(\"font-size\", \"14\"),\n svg.prop(\"fill\", \"white\")\n ),\n \"Interest Rate\"\n ),\n svg.text(\n string.concat(\n GEIST,\n svg.prop(\"x\", \"265\"),\n svg.prop(\"y\", \"422\"),\n svg.prop(\"font-size\", \"20\"),\n svg.prop(\"fill\", \"white\")\n ),\n \"%\"\n ),\n svg.text(\n string.concat(\n GEIST,\n svg.prop(\"x\", \"16\"),\n svg.prop(\"y\", \"462\"),\n svg.prop(\"font-size\", \"14\"),\n svg.prop(\"fill\", \"white\")\n ),\n \"Owner\"\n )\n );\n }\n\n function _formattedDynamicEl(string memory _value, uint256 _x, uint256 _y) internal pure returns (string memory) {\n return svg.text(\n string.concat(\n GEIST,\n svg.prop(\"text-anchor\", \"end\"),\n svg.prop(\"x\", LibString.toString(_x)),\n svg.prop(\"y\", LibString.toString(_y)),\n svg.prop(\"font-size\", \"20\"),\n svg.prop(\"fill\", \"white\")\n ),\n _value\n );\n }\n\n function _formattedIdEl(string memory _id) internal pure returns (string memory) {\n return svg.text(\n string.concat(\n GEIST,\n svg.prop(\"text-anchor\", \"end\"),\n svg.prop(\"x\", \"284\"),\n svg.prop(\"y\", \"33\"),\n svg.prop(\"font-size\", \"14\"),\n svg.prop(\"fill\", \"white\")\n ),\n _id\n );\n }\n\n function _formattedAddressEl(address _address) internal pure returns (string memory) {\n return svg.text(\n string.concat(\n GEIST,\n svg.prop(\"text-anchor\", \"end\"),\n svg.prop(\"x\", \"284\"),\n svg.prop(\"y\", \"462\"),\n svg.prop(\"font-size\", \"14\"),\n svg.prop(\"fill\", \"white\")\n ),\n string.concat(\n LibString.slice(LibString.toHexStringChecksummed(_address), 0, 6),\n \"...\",\n LibString.slice(LibString.toHexStringChecksummed(_address), 38, 42)\n )\n );\n }\n\n function _collLogo(string memory _collName, FixedAssetReader _assetReader) internal view returns (string memory) {\n return svg.el(\n \"image\",\n string.concat(\n svg.prop(\"x\", \"264\"),\n svg.prop(\"y\", \"342.5\"),\n svg.prop(\"width\", \"20\"),\n svg.prop(\"height\", \"20\"),\n svg.prop(\n \"href\",\n string.concat(\n \"data:image/svg+xml;base64,\", _assetReader.readAsset(bytes4(keccak256(bytes(_collName))))\n )\n )\n )\n );\n }\n\n function _statusEl(string memory _status) internal pure returns (string memory) {\n return svg.text(\n string.concat(\n GEIST, svg.prop(\"x\", \"40\"), svg.prop(\"y\", \"33\"), svg.prop(\"font-size\", \"14\"), svg.prop(\"fill\", \"white\")\n ),\n _status\n );\n }\n\n function _dynamicTextEls(uint256 _debt, uint256 _coll, uint256 _annualInterestRate)\n internal\n pure\n returns (string memory)\n {\n return string.concat(\n _formattedDynamicEl(numUtils.toLocaleString(_coll, 18, 4), 256, 360),\n _formattedDynamicEl(numUtils.toLocaleString(_debt, 18, 2), 256, 391),\n _formattedDynamicEl(numUtils.toLocaleString(_annualInterestRate, 16, 2), 256, 422)\n );\n }\n}\n"},{"file_path":"lib/openzeppelin-contracts/contracts/interfaces/IERC5267.sol","source_code":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (interfaces/IERC5267.sol)\n\npragma solidity ^0.8.0;\n\ninterface IERC5267 {\n /**\n * @dev MAY be emitted to signal that the domain could have changed.\n */\n event EIP712DomainChanged();\n\n /**\n * @dev returns the fields and values that describe the domain separator used by this contract for EIP-712\n * signature.\n */\n function eip712Domain()\n external\n view\n returns (\n bytes1 fields,\n string memory name,\n string memory version,\n uint256 chainId,\n address verifyingContract,\n bytes32 salt,\n uint256[] memory extensions\n );\n}\n"},{"file_path":"src/Interfaces/IAddressesRegistry.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"./IActivePool.sol\";\nimport \"./IBoldToken.sol\";\nimport \"./IBorrowerOperations.sol\";\nimport \"./ICollSurplusPool.sol\";\nimport \"./IDefaultPool.sol\";\nimport \"./IHintHelpers.sol\";\nimport \"./IMultiTroveGetter.sol\";\nimport \"./ISortedTroves.sol\";\nimport \"./IStabilityPool.sol\";\nimport \"./ITroveManager.sol\";\nimport \"./ITroveNFT.sol\";\nimport {IMetadataNFT} from \"../NFTMetadata/MetadataNFT.sol\";\nimport \"./ICollateralRegistry.sol\";\nimport \"./IInterestRouter.sol\";\nimport \"./IPriceFeed.sol\";\nimport \"./IAeroManager.sol\";\n\ninterface IAddressesRegistry {\n struct AddressVars {\n IERC20Metadata collToken;\n IBorrowerOperations borrowerOperations;\n ITroveManager troveManager;\n ITroveNFT troveNFT;\n IMetadataNFT metadataNFT;\n IStabilityPool stabilityPool;\n IPriceFeed priceFeed;\n IActivePool activePool;\n IDefaultPool defaultPool;\n address gasPoolAddress;\n ICollSurplusPool collSurplusPool;\n ISortedTroves sortedTroves;\n IInterestRouter interestRouter;\n IHintHelpers hintHelpers;\n IMultiTroveGetter multiTroveGetter;\n ICollateralRegistry collateralRegistry;\n IBoldToken boldToken;\n IWETH WETH;\n IAeroManager aeroManager;\n }\n\n function CCR() external returns (uint256);\n function SCR() external returns (uint256);\n function MCR() external returns (uint256);\n function BCR() external returns (uint256);\n function LIQUIDATION_PENALTY_SP() external returns (uint256);\n function LIQUIDATION_PENALTY_REDISTRIBUTION() external returns (uint256);\n\n function collToken() external view returns (IERC20Metadata);\n function borrowerOperations() external view returns (IBorrowerOperations);\n function troveManager() external view returns (ITroveManager);\n function troveNFT() external view returns (ITroveNFT);\n function metadataNFT() external view returns (IMetadataNFT);\n function stabilityPool() external view returns (IStabilityPool);\n function priceFeed() external view returns (IPriceFeed);\n function activePool() external view returns (IActivePool);\n function defaultPool() external view returns (IDefaultPool);\n function gasPoolAddress() external view returns (address);\n function collSurplusPool() external view returns (ICollSurplusPool);\n function sortedTroves() external view returns (ISortedTroves);\n function interestRouter() external view returns (IInterestRouter);\n function hintHelpers() external view returns (IHintHelpers);\n function multiTroveGetter() external view returns (IMultiTroveGetter);\n function collateralRegistry() external view returns (ICollateralRegistry);\n function boldToken() external view returns (IBoldToken);\n function WETH() external returns (IWETH);\n function debtLimit() external returns (uint256);\n\n function aeroManager() external view returns (IAeroManager);\n\n function setAddresses(AddressVars memory _vars) external;\n}\n"},{"file_path":"src/NFTMetadata/utils/SVG.sol","source_code":"//SPDX-License-Identifier: MIT\npragma solidity ^0.8.18;\n\nimport {utils, LibString} from \"./Utils.sol\";\n\n/// @notice Core SVG utility library which helps us construct onchain SVG's with a simple, web-like API.\n/// @author Modified from (https://github.com/w1nt3r-eth/hot-chain-svg/blob/main/contracts/SVG.sol) by w1nt3r-eth.\n\nlibrary svg {\n /* GLOBAL CONSTANTS */\n string internal constant _SVG = 'xmlns=\"http://www.w3.org/2000/svg\"';\n string internal constant _HTML = 'xmlns=\"http://www.w3.org/1999/xhtml\"';\n string internal constant _XMLNS = \"http://www.w3.org/2000/xmlns/ \";\n string internal constant _XLINK = \"http://www.w3.org/1999/xlink \";\n\n /* MAIN ELEMENTS */\n function g(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"g\", _props, _children);\n }\n\n function _svg(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"svg\", string.concat(_SVG, \" \", _props), _children);\n }\n\n function style(string memory _title, string memory _props) internal pure returns (string memory) {\n return el(\"style\", string.concat(\".\", _title, \" \", _props));\n }\n\n function path(string memory _d) internal pure returns (string memory) {\n return el(\"path\", prop(\"d\", _d, true));\n }\n\n function path(string memory _d, string memory _props) internal pure returns (string memory) {\n return el(\"path\", string.concat(prop(\"d\", _d), _props));\n }\n\n function path(string memory _d, string memory _props, string memory _children)\n internal\n pure\n returns (string memory)\n {\n return el(\"path\", string.concat(prop(\"d\", _d), _props), _children);\n }\n\n function text(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"text\", _props, _children);\n }\n\n function line(string memory _props) internal pure returns (string memory) {\n return el(\"line\", _props);\n }\n\n function line(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"line\", _props, _children);\n }\n\n function circle(string memory _props) internal pure returns (string memory) {\n return el(\"circle\", _props);\n }\n\n function circle(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"circle\", _props, _children);\n }\n\n function circle(string memory cx, string memory cy, string memory r) internal pure returns (string memory) {\n return el(\"circle\", string.concat(prop(\"cx\", cx), prop(\"cy\", cy), prop(\"r\", r, true)));\n }\n\n function circle(string memory cx, string memory cy, string memory r, string memory _children)\n internal\n pure\n returns (string memory)\n {\n return el(\"circle\", string.concat(prop(\"cx\", cx), prop(\"cy\", cy), prop(\"r\", r, true)), _children);\n }\n\n function circle(string memory cx, string memory cy, string memory r, string memory _props, string memory _children)\n internal\n pure\n returns (string memory)\n {\n return el(\"circle\", string.concat(prop(\"cx\", cx), prop(\"cy\", cy), prop(\"r\", r), _props), _children);\n }\n\n function ellipse(string memory _props) internal pure returns (string memory) {\n return el(\"ellipse\", _props);\n }\n\n function ellipse(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"ellipse\", _props, _children);\n }\n\n function polygon(string memory _props) internal pure returns (string memory) {\n return el(\"polygon\", _props);\n }\n\n function polygon(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"polygon\", _props, _children);\n }\n\n function polyline(string memory _props) internal pure returns (string memory) {\n return el(\"polyline\", _props);\n }\n\n function polyline(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"polyline\", _props, _children);\n }\n\n function rect(string memory _props) internal pure returns (string memory) {\n return el(\"rect\", _props);\n }\n\n function rect(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"rect\", _props, _children);\n }\n\n function filter(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"filter\", _props, _children);\n }\n\n function cdata(string memory _content) internal pure returns (string memory) {\n return string.concat(\"\");\n }\n\n /* GRADIENTS */\n function radialGradient(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"radialGradient\", _props, _children);\n }\n\n function linearGradient(string memory _props, string memory _children) internal pure returns (string memory) {\n return el(\"linearGradient\", _props, _children);\n }\n\n function gradientStop(uint256 offset, string memory stopColor, string memory _props)\n internal\n pure\n returns (string memory)\n {\n return el(\n \"stop\",\n string.concat(\n prop(\"stop-color\", stopColor),\n \" \",\n prop(\"offset\", string.concat(LibString.toString(offset), \"%\")),\n \" \",\n _props\n ),\n utils.NULL\n );\n }\n\n /* ANIMATION */\n function animateTransform(string memory _props) internal pure returns (string memory) {\n return el(\"animateTransform\", _props);\n }\n\n function animate(string memory _props) internal pure returns (string memory) {\n return el(\"animate\", _props);\n }\n\n /* COMMON */\n // A generic element, can be used to construct any SVG (or HTML) element\n function el(string memory _tag, string memory _props, string memory _children)\n internal\n pure\n returns (string memory)\n {\n return string.concat(\"<\", _tag, \" \", _props, \">\", _children, \"\");\n }\n\n // A generic element, can be used to construct SVG (or HTML) elements without children\n function el(string memory _tag, string memory _props) internal pure returns (string memory) {\n return string.concat(\"<\", _tag, \" \", _props, \"/>\");\n }\n\n // an SVG attribute\n function prop(string memory _key, string memory _val) internal pure returns (string memory) {\n return string.concat(_key, \"=\", '\"', _val, '\" ');\n }\n\n function prop(string memory _key, string memory _val, bool last) internal pure returns (string memory) {\n if (last) {\n return string.concat(_key, \"=\", '\"', _val, '\"');\n } else {\n return string.concat(_key, \"=\", '\"', _val, '\" ');\n }\n }\n}\n"},{"file_path":"src/Interfaces/IHintHelpers.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\ninterface IHintHelpers {\n function getApproxHint(uint256 _collIndex, uint256 _interestRate, uint256 _numTrials, uint256 _inputRandomSeed)\n external\n view\n returns (uint256 hintId, uint256 diff, uint256 latestRandomSeed);\n\n function predictOpenTroveUpfrontFee(uint256 _collIndex, uint256 _borrowedAmount, uint256 _interestRate)\n external\n view\n returns (uint256);\n\n function predictAdjustInterestRateUpfrontFee(uint256 _collIndex, uint256 _troveId, uint256 _newInterestRate)\n external\n view\n returns (uint256);\n\n function forcePredictAdjustInterestRateUpfrontFee(uint256 _collIndex, uint256 _troveId, uint256 _newInterestRate)\n external\n view\n returns (uint256);\n\n function predictAdjustTroveUpfrontFee(uint256 _collIndex, uint256 _troveId, uint256 _debtIncrease)\n external\n view\n returns (uint256);\n\n function predictAdjustBatchInterestRateUpfrontFee(\n uint256 _collIndex,\n address _batchAddress,\n uint256 _newInterestRate\n ) external view returns (uint256);\n\n function predictJoinBatchInterestRateUpfrontFee(uint256 _collIndex, uint256 _troveId, address _batchAddress)\n external\n view\n returns (uint256);\n}\n"},{"file_path":"src/Interfaces/ITroveNFT.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"openzeppelin-contracts/contracts/token/ERC721/extensions/IERC721Metadata.sol\";\n\nimport \"./ITroveManager.sol\";\n\ninterface ITroveNFT is IERC721Metadata {\n function mint(address _owner, uint256 _troveId) external;\n function burn(uint256 _troveId) external;\n}\n"},{"file_path":"lib/openzeppelin-contracts/contracts/token/ERC721/extensions/IERC721Metadata.sol","source_code":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (token/ERC721/extensions/IERC721Metadata.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../IERC721.sol\";\n\n/**\n * @title ERC-721 Non-Fungible Token Standard, optional metadata extension\n * @dev See https://eips.ethereum.org/EIPS/eip-721\n */\ninterface IERC721Metadata is IERC721 {\n /**\n * @dev Returns the token collection name.\n */\n function name() external view returns (string memory);\n\n /**\n * @dev Returns the token collection symbol.\n */\n function symbol() external view returns (string memory);\n\n /**\n * @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token.\n */\n function tokenURI(uint256 tokenId) external view returns (string memory);\n}\n"},{"file_path":"lib/openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Permit.sol","source_code":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.4) (token/ERC20/extensions/IERC20Permit.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in\n * https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].\n *\n * Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by\n * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't\n * need to send a transaction, and thus is not required to hold Ether at all.\n *\n * ==== Security Considerations\n *\n * There are two important considerations concerning the use of `permit`. The first is that a valid permit signature\n * expresses an allowance, and it should not be assumed to convey additional meaning. In particular, it should not be\n * considered as an intention to spend the allowance in any specific way. The second is that because permits have\n * built-in replay protection and can be submitted by anyone, they can be frontrun. A protocol that uses permits should\n * take this into consideration and allow a `permit` call to fail. Combining these two aspects, a pattern that may be\n * generally recommended is:\n *\n * ```solidity\n * function doThingWithPermit(..., uint256 value, uint256 deadline, uint8 v, bytes32 r, bytes32 s) public {\n * try token.permit(msg.sender, address(this), value, deadline, v, r, s) {} catch {}\n * doThing(..., value);\n * }\n *\n * function doThing(..., uint256 value) public {\n * token.safeTransferFrom(msg.sender, address(this), value);\n * ...\n * }\n * ```\n *\n * Observe that: 1) `msg.sender` is used as the owner, leaving no ambiguity as to the signer intent, and 2) the use of\n * `try/catch` allows the permit to fail and makes the code tolerant to frontrunning. (See also\n * {SafeERC20-safeTransferFrom}).\n *\n * Additionally, note that smart contract wallets (such as Argent or Safe) are not able to produce permit signatures, so\n * contracts should have entry points that don't rely on permit.\n */\ninterface IERC20Permit {\n /**\n * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,\n * given ``owner``'s signed approval.\n *\n * IMPORTANT: The same issues {IERC20-approve} has related to transaction\n * ordering also apply here.\n *\n * Emits an {Approval} event.\n *\n * Requirements:\n *\n * - `spender` cannot be the zero address.\n * - `deadline` must be a timestamp in the future.\n * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`\n * over the EIP712-formatted function arguments.\n * - the signature must use ``owner``'s current nonce (see {nonces}).\n *\n * For more information on the signature format, see the\n * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP\n * section].\n *\n * CAUTION: See Security Considerations above.\n */\n function permit(\n address owner,\n address spender,\n uint256 value,\n uint256 deadline,\n uint8 v,\n bytes32 r,\n bytes32 s\n ) external;\n\n /**\n * @dev Returns the current nonce for `owner`. This value must be\n * included whenever a signature is generated for {permit}.\n *\n * Every successful call to {permit} increases ``owner``'s nonce by one. This\n * prevents a signature from being used multiple times.\n */\n function nonces(address owner) external view returns (uint256);\n\n /**\n * @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.\n */\n // solhint-disable-next-line func-name-mixedcase\n function DOMAIN_SEPARATOR() external view returns (bytes32);\n}\n"},{"file_path":"src/Interfaces/IBoldToken.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol\";\nimport \"openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Permit.sol\";\nimport \"openzeppelin-contracts/contracts/interfaces/IERC5267.sol\";\n\ninterface IBoldToken is IERC20Metadata, IERC20Permit, IERC5267 {\n function setBranchAddresses(\n address _troveManagerAddress,\n address _stabilityPoolAddress,\n address _borrowerOperationsAddress,\n address _activePoolAddress\n ) external;\n\n function setBranchAddressesViaCollateralRegistry(\n address _troveManagerAddress,\n address _stabilityPoolAddress,\n address _borrowerOperationsAddress,\n address _activePoolAddress\n ) external;\n\n function setCollateralRegistry(address _collateralRegistryAddress) external;\n\n function mint(address _account, uint256 _amount) external;\n\n function burn(address _account, uint256 _amount) external;\n\n function sendToPool(address _sender, address poolAddress, uint256 _amount) external;\n\n function returnFromPool(address poolAddress, address user, uint256 _amount) external;\n}\n"},{"file_path":"src/Interfaces/IActivePool.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"./IInterestRouter.sol\";\nimport \"./IBoldRewardsReceiver.sol\";\nimport \"../Types/TroveChange.sol\";\nimport \"openzeppelin-contracts/contracts/token/ERC20/IERC20.sol\";\n\ninterface IActivePool {\n function defaultPoolAddress() external view returns (address);\n function borrowerOperationsAddress() external view returns (address);\n function troveManagerAddress() external view returns (address);\n function interestRouter() external view returns (IInterestRouter);\n // We avoid IStabilityPool here in order to prevent creating a dependency cycle that would break flattening\n function stabilityPool() external view returns (IBoldRewardsReceiver);\n\n function getCollBalance() external view returns (uint256);\n function getBoldDebt() external view returns (uint256);\n function lastAggUpdateTime() external view returns (uint256);\n function aggRecordedDebt() external view returns (uint256);\n function aggWeightedDebtSum() external view returns (uint256);\n function aggBatchManagementFees() external view returns (uint256);\n function aggWeightedBatchManagementFeeSum() external view returns (uint256);\n function calcPendingAggInterest() external view returns (uint256);\n function calcPendingSPYield() external view returns (uint256);\n function calcPendingAggBatchManagementFee() external view returns (uint256);\n function getNewApproxAvgInterestRateFromTroveChange(TroveChange calldata _troveChange)\n external\n view\n returns (uint256);\n\n function mintAggInterest() external;\n function mintAggInterestAndAccountForTroveChange(TroveChange calldata _troveChange, address _batchManager)\n external;\n function mintBatchManagementFeeAndAccountForChange(TroveChange calldata _troveChange, address _batchAddress)\n external;\n\n function setShutdownFlag() external;\n function hasBeenShutDown() external view returns (bool);\n function shutdownTime() external view returns (uint256);\n\n function sendColl(address _account, uint256 _amount) external;\n function sendCollToDefaultPool(uint256 _amount) external;\n function receiveColl(uint256 _amount) external;\n function accountForReceivedColl(uint256 _amount) external;\n\n function isAeroLPCollateral() external view returns (bool);\n function aeroManagerAddress() external view returns (address);\n function aeroGaugeAddress() external view returns (address);\n function collToken() external view returns (IERC20);\n function collSurplusPoolAddress() external view returns (address);\n}\n"},{"file_path":"src/Interfaces/IInterestRouter.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\ninterface IInterestRouter {\n// Currently the Interest Router doesn’t need any specific function\n}\n"},{"file_path":"src/Interfaces/IWETH.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity ^0.8.0;\n\nimport \"openzeppelin-contracts/contracts/token/ERC20/extensions/IERC20Metadata.sol\";\n\ninterface IWETH is IERC20Metadata {\n function deposit() external payable;\n function withdraw(uint256 wad) external;\n}\n"},{"file_path":"src/Types/BatchId.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity 0.8.24;\n\ntype BatchId is address;\n\nusing {equals as ==, notEquals as !=, isZero, isNotZero} for BatchId global;\n\nfunction equals(BatchId a, BatchId b) pure returns (bool) {\n return BatchId.unwrap(a) == BatchId.unwrap(b);\n}\n\nfunction notEquals(BatchId a, BatchId b) pure returns (bool) {\n return !(a == b);\n}\n\nfunction isZero(BatchId x) pure returns (bool) {\n return x == BATCH_ID_ZERO;\n}\n\nfunction isNotZero(BatchId x) pure returns (bool) {\n return !x.isZero();\n}\n\nBatchId constant BATCH_ID_ZERO = BatchId.wrap(address(0));\n"},{"file_path":"lib/openzeppelin-contracts/contracts/token/ERC721/IERC721.sol","source_code":"// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC721/IERC721.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../../utils/introspection/IERC165.sol\";\n\n/**\n * @dev Required interface of an ERC721 compliant contract.\n */\ninterface IERC721 is IERC165 {\n /**\n * @dev Emitted when `tokenId` token is transferred from `from` to `to`.\n */\n event Transfer(address indexed from, address indexed to, uint256 indexed tokenId);\n\n /**\n * @dev Emitted when `owner` enables `approved` to manage the `tokenId` token.\n */\n event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId);\n\n /**\n * @dev Emitted when `owner` enables or disables (`approved`) `operator` to manage all of its assets.\n */\n event ApprovalForAll(address indexed owner, address indexed operator, bool approved);\n\n /**\n * @dev Returns the number of tokens in ``owner``'s account.\n */\n function balanceOf(address owner) external view returns (uint256 balance);\n\n /**\n * @dev Returns the owner of the `tokenId` token.\n *\n * Requirements:\n *\n * - `tokenId` must exist.\n */\n function ownerOf(uint256 tokenId) external view returns (address owner);\n\n /**\n * @dev Safely transfers `tokenId` token from `from` to `to`.\n *\n * Requirements:\n *\n * - `from` cannot be the zero address.\n * - `to` cannot be the zero address.\n * - `tokenId` token must exist and be owned by `from`.\n * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.\n * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.\n *\n * Emits a {Transfer} event.\n */\n function safeTransferFrom(address from, address to, uint256 tokenId, bytes calldata data) external;\n\n /**\n * @dev Safely transfers `tokenId` token from `from` to `to`, checking first that contract recipients\n * are aware of the ERC721 protocol to prevent tokens from being forever locked.\n *\n * Requirements:\n *\n * - `from` cannot be the zero address.\n * - `to` cannot be the zero address.\n * - `tokenId` token must exist and be owned by `from`.\n * - If the caller is not `from`, it must have been allowed to move this token by either {approve} or {setApprovalForAll}.\n * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.\n *\n * Emits a {Transfer} event.\n */\n function safeTransferFrom(address from, address to, uint256 tokenId) external;\n\n /**\n * @dev Transfers `tokenId` token from `from` to `to`.\n *\n * WARNING: Note that the caller is responsible to confirm that the recipient is capable of receiving ERC721\n * or else they may be permanently lost. Usage of {safeTransferFrom} prevents loss, though the caller must\n * understand this adds an external call which potentially creates a reentrancy vulnerability.\n *\n * Requirements:\n *\n * - `from` cannot be the zero address.\n * - `to` cannot be the zero address.\n * - `tokenId` token must be owned by `from`.\n * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.\n *\n * Emits a {Transfer} event.\n */\n function transferFrom(address from, address to, uint256 tokenId) external;\n\n /**\n * @dev Gives permission to `to` to transfer `tokenId` token to another account.\n * The approval is cleared when the token is transferred.\n *\n * Only a single account can be approved at a time, so approving the zero address clears previous approvals.\n *\n * Requirements:\n *\n * - The caller must own the token or be an approved operator.\n * - `tokenId` must exist.\n *\n * Emits an {Approval} event.\n */\n function approve(address to, uint256 tokenId) external;\n\n /**\n * @dev Approve or remove `operator` as an operator for the caller.\n * Operators can call {transferFrom} or {safeTransferFrom} for any token owned by the caller.\n *\n * Requirements:\n *\n * - The `operator` cannot be the caller.\n *\n * Emits an {ApprovalForAll} event.\n */\n function setApprovalForAll(address operator, bool approved) external;\n\n /**\n * @dev Returns the account approved for `tokenId` token.\n *\n * Requirements:\n *\n * - `tokenId` must exist.\n */\n function getApproved(uint256 tokenId) external view returns (address operator);\n\n /**\n * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`.\n *\n * See {setApprovalForAll}\n */\n function isApprovedForAll(address owner, address operator) external view returns (bool);\n}\n"},{"file_path":"src/NFTMetadata/utils/JSON.sol","source_code":"//SPDX-License-Identifier: MIT\npragma solidity ^0.8.12;\n\n// JSON utilities for base64 encoded ERC721 JSON metadata scheme\nlibrary json {\n /////////////////////////////////////////////////////////////////////////////////////////////////////////////\n /// @dev JSON requires that double quotes be escaped or JSONs will not build correctly\n /// string.concat also requires an escape, use \\\\\" or the constant DOUBLE_QUOTES to represent \" in JSON\n /////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\n string constant DOUBLE_QUOTES = '\\\\\"';\n\n function formattedMetadata(\n string memory name,\n string memory description,\n string memory svgImg,\n string memory attributes\n ) internal pure returns (string memory) {\n return string.concat(\n \"data:application/json;base64,\",\n encode(\n bytes(\n string.concat(\n \"{\",\n _prop(\"name\", name),\n _prop(\"description\", description),\n _xmlImage(svgImg),\n ',\"attributes\":',\n attributes,\n \"}\"\n )\n )\n )\n );\n }\n\n function _xmlImage(string memory _svgImg) internal pure returns (string memory) {\n return _prop(\"image\", string.concat(\"data:image/svg+xml;base64,\", encode(bytes(_svgImg))), true);\n }\n\n function _prop(string memory _key, string memory _val) internal pure returns (string memory) {\n return string.concat('\"', _key, '\": ', '\"', _val, '\", ');\n }\n\n function _prop(string memory _key, string memory _val, bool last) internal pure returns (string memory) {\n if (last) {\n return string.concat('\"', _key, '\": ', '\"', _val, '\"');\n } else {\n return string.concat('\"', _key, '\": ', '\"', _val, '\", ');\n }\n }\n\n function _object(string memory _key, string memory _val) internal pure returns (string memory) {\n return string.concat('\"', _key, '\": ', \"{\", _val, \"}\");\n }\n\n /**\n * taken from Openzeppelin\n * @dev Base64 Encoding/Decoding Table\n */\n string internal constant _TABLE = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\n\n /**\n * @dev Converts a `bytes` to its Bytes64 `string` representation.\n */\n function encode(bytes memory data) internal pure returns (string memory) {\n /**\n * Inspired by Brecht Devos (Brechtpd) implementation - MIT licence\n * https://github.com/Brechtpd/base64/blob/e78d9fd951e7b0977ddca77d92dc85183770daf4/base64.sol\n */\n if (data.length == 0) return \"\";\n\n // Loads the table into memory\n string memory table = _TABLE;\n\n // Encoding takes 3 bytes chunks of binary data from `bytes` data parameter\n // and split into 4 numbers of 6 bits.\n // The final Base64 length should be `bytes` data length multiplied by 4/3 rounded up\n // - `data.length + 2` -> Round up\n // - `/ 3` -> Number of 3-bytes chunks\n // - `4 *` -> 4 characters for each chunk\n string memory result = new string(4 * ((data.length + 2) / 3));\n\n assembly {\n // Prepare the lookup table (skip the first \"length\" byte)\n let tablePtr := add(table, 1)\n\n // Prepare result pointer, jump over length\n let resultPtr := add(result, 32)\n\n // Run over the input, 3 bytes at a time\n for {\n let dataPtr := data\n let endPtr := add(data, mload(data))\n } lt(dataPtr, endPtr) {} {\n // Advance 3 bytes\n dataPtr := add(dataPtr, 3)\n let input := mload(dataPtr)\n\n // To write each character, shift the 3 bytes (18 bits) chunk\n // 4 times in blocks of 6 bits for each character (18, 12, 6, 0)\n // and apply logical AND with 0x3F which is the number of\n // the previous character in the ASCII table prior to the Base64 Table\n // The result is then added to the table to get the character to write,\n // and finally write it in the result pointer but with a left shift\n // of 256 (1 byte) - 8 (1 ASCII char) = 248 bits\n\n mstore8(resultPtr, mload(add(tablePtr, and(shr(18, input), 0x3F))))\n resultPtr := add(resultPtr, 1) // Advance\n\n mstore8(resultPtr, mload(add(tablePtr, and(shr(12, input), 0x3F))))\n resultPtr := add(resultPtr, 1) // Advance\n\n mstore8(resultPtr, mload(add(tablePtr, and(shr(6, input), 0x3F))))\n resultPtr := add(resultPtr, 1) // Advance\n\n mstore8(resultPtr, mload(add(tablePtr, and(input, 0x3F))))\n resultPtr := add(resultPtr, 1) // Advance\n }\n\n // When data `bytes` is not exactly 3 bytes long\n // it is padded with `=` characters at the end\n switch mod(mload(data), 3)\n case 1 {\n mstore8(sub(resultPtr, 1), 0x3d)\n mstore8(sub(resultPtr, 2), 0x3d)\n }\n case 2 { mstore8(sub(resultPtr, 1), 0x3d) }\n }\n\n return result;\n }\n}\n"},{"file_path":"src/Types/TroveChange.sol","source_code":"// SPDX-License-Identifier: MIT\n\npragma solidity 0.8.24;\n\nstruct TroveChange {\n uint256 appliedRedistBoldDebtGain;\n uint256 appliedRedistCollGain;\n uint256 collIncrease;\n uint256 collDecrease;\n uint256 debtIncrease;\n uint256 debtDecrease;\n uint256 newWeightedRecordedDebt;\n uint256 oldWeightedRecordedDebt;\n uint256 upfrontFee;\n uint256 batchAccruedManagementFee;\n uint256 newWeightedRecordedBatchManagementFee;\n uint256 oldWeightedRecordedBatchManagementFee;\n}\n"}],"certified":false,"conflicting_implementations":null,"abi":[{"inputs":[{"internalType":"contract IBoldToken","name":"_boldToken","type":"address"},{"internalType":"contract IERC20Metadata[]","name":"_tokens","type":"address[]"},{"internalType":"contract ITroveManager[]","name":"_troveManagers","type":"address[]"},{"internalType":"contract IAeroManager","name":"_aeroManager","type":"address"},{"internalType":"address","name":"_governor","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"oldAeroManager","type":"address"},{"indexed":false,"internalType":"address","name":"newAeroManager","type":"address"}],"name":"AeroManagerUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"_baseRate","type":"uint256"}],"name":"BaseRateUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"_totalCollaterals","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"_index","type":"uint256"},{"indexed":false,"internalType":"contract IERC20Metadata","name":"_token","type":"address"},{"indexed":false,"internalType":"contract ITroveManager","name":"_troveManager","type":"address"},{"indexed":false,"internalType":"bool","name":"_isRedeemable","type":"bool"}],"name":"CollateralBranchAdded","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"oldGovernor","type":"address"},{"indexed":false,"internalType":"address","name":"newGovernor","type":"address"}],"name":"CollateralGovernorUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"cancelledGovernor","type":"address"}],"name":"GovernorProposalCancelled","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"pendingGovernor","type":"address"},{"indexed":false,"internalType":"uint256","name":"activateAtTimestamp","type":"uint256"}],"name":"GovernorProposed","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"oldGovernor","type":"address"},{"indexed":false,"internalType":"address","name":"newGovernor","type":"address"}],"name":"GovernorUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"_lastFeeOpTime","type":"uint256"}],"name":"LastFeeOpTimeUpdated","type":"event"},{"inputs":[],"name":"acceptGovernor","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"aeroManager","outputs":[{"internalType":"contract IAeroManager","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"baseRate","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"boldToken","outputs":[{"internalType":"contract IBoldToken","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"cancelGovernorProposal","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"collateralGovernor","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"contract IAddressesRegistry","name":"_addressesRegistry","type":"address"},{"internalType":"bool","name":"_isRedeemable","type":"bool"}],"name":"createNewBranch","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"getAllTroveManagers","outputs":[{"internalType":"contract ITroveManager[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_indexTroveManager","type":"uint256"}],"name":"getDebtLimit","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_redeemAmount","type":"uint256"}],"name":"getEffectiveRedemptionFeeInBold","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_indexTroveManager","type":"uint256"}],"name":"getNonRedeemableDebtLimit","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_index","type":"uint256"}],"name":"getNonRedeemableToken","outputs":[{"internalType":"contract IERC20Metadata","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_index","type":"uint256"}],"name":"getNonRedeemableTroveManager","outputs":[{"internalType":"contract ITroveManager","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getNonRedeemableTroveManagers","outputs":[{"internalType":"contract ITroveManager[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_ETHDrawn","type":"uint256"}],"name":"getRedemptionFeeWithDecay","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getRedemptionRate","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_redeemAmount","type":"uint256"}],"name":"getRedemptionRateForRedeemedAmount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getRedemptionRateWithDecay","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_index","type":"uint256"}],"name":"getToken","outputs":[{"internalType":"contract IERC20Metadata","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_index","type":"uint256"}],"name":"getTroveManager","outputs":[{"internalType":"contract ITroveManager","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getTroveManagers","outputs":[{"internalType":"contract ITroveManager[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"governor","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"hasAeroLPCollateralBranch","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"lastFeeOperationTime","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"pendingGovernor","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"pendingGovernorTimestamp","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_newGovernor","type":"address"}],"name":"proposeGovernor","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_boldAmount","type":"uint256"},{"internalType":"uint256","name":"_maxIterationsPerCollateral","type":"uint256"},{"internalType":"uint256","name":"_maxFeePercentage","type":"uint256"}],"name":"redeemCollateral","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"totalCollaterals","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"contract IAeroManager","name":"_newAeroManager","type":"address"}],"name":"updateAeroManager","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_newCollateralGovernor","type":"address"}],"name":"updateCollateralGovernor","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_indexTroveManager","type":"uint256"},{"internalType":"uint256","name":"_newDebtLimit","type":"uint256"}],"name":"updateDebtLimit","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_indexTroveManager","type":"uint256"},{"internalType":"uint256","name":"_newDebtLimit","type":"uint256"}],"name":"updateNonRedeemableDebtLimit","outputs":[],"stateMutability":"nonpayable","type":"function"}],"is_changed_bytecode":false,"is_partially_verified":false,"constructor_args":"0x000000000000000000000000252d36f435582ecb01686448d21e8c9ea0b2ca6500000000000000000000000000000000000000000000000000000000000000a00000000000000000000000000000000000000000000000000000000000000160000000000000000000000000e8900c7aebca7d212717fe2f4df9f567e3f4d7f4000000000000000000000000519ca17dae2e2a23396ebec12da1f645accec19600000000000000000000000000000000000000000000000000000000000000050000000000000000000000004200000000000000000000000000000000000006000000000000000000000000c1cba3fcea344f92d9239c08c0568f6f2f0ee452000000000000000000000000b6fe221fe9eef5aba221c348ba20a1bf5e73624c00000000000000000000000092a7aee8afaa71ba0a9cc04a3dbe1f34237c33e00000000000000000000000002ae3f1ec7f1f5012cfeab0185bfc7aa3cf0dec220000000000000000000000000000000000000000000000000000000000000005000000000000000000000000a957d42c4c43eb97d5f71b8435eb638e5dd9f63900000000000000000000000079a6a3361eae4d4b80939206426f2320c11a4bfb000000000000000000000000d31987fcba98f471b6e4220c52f7741b11b2fc5e000000000000000000000000835b04eefbb0e32d8f75cfe96acb527a42f1a0d9000000000000000000000000482de97e667330afba99f8ced527118aec66f15d"}