Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Similar
• Submit Audit
• Compare

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

import "src/modules/CDPModule.sol";
import "src/modules/PegStabilityModule.sol";
import "src/periphery/PSMLockup.sol";
import "@prb/math/contracts/PRBMathUD60x18.sol";
import "@prb/math/contracts/PRBMathSD59x18.sol";

/// @notice A collateral manager that sets the interest rates dynamically.
contract InterestCollateralManager is ICollateralManager, YSSModule {
    using PRBMathUD60x18 for uint256;
    using PRBMathSD59x18 for int256;

    CDPModule public immutable cdpModule;
    PegStabilityModule public immutable psm;
    PSMLockup public immutable lockup;

    IERC20 public externalStablecoin;

    uint8 public immutable yssDecimals;
    uint8 public immutable externalDecimals;

    uint256 public maxInterestRate;
    uint256 public minInterestRate;

    /// @notice The y axis is the interest rate and the x axis is the utilization ratio
    struct CTypeInterestParams {
        uint256 slope1;
        uint256 slope2;
        uint256 slope3;
        int256 yIntercept1;
        int256 yIntercept2;
        int256 yIntercept3;
        uint256 utilA;
        uint256 utilB;
    }

    // From a utilization of 0 to utilA, the interest rate varies linearly
    // from interestRateA to interestRateB. From utilA to utilB, the interest
    // rate varies linearly from interestRateB to interestRateC. From utilB to
    // 1, the interest rate varies linearly from interestRateC to interestRateD.
    struct SetCTypeInterestParamsArgs {
        uint256 cTypeId;
        uint256 utilA;
        uint256 utilB;
        uint256 interestRateA;
        uint256 interestRateB;
        uint256 interestRateC;
        uint256 interestRateD;
    }

    uint256[] public cTypeIds;
    mapping(uint256 cTypeId => CTypeInterestParams params) public cTypeInterestParams;

    /// @notice Emitted when the collateral type interest params are set
    event SetCTypeInterestParams(
        uint256 cTypeId,
        uint256 slope1,
        uint256 slope2,
        uint256 slope3,
        int256 yIntercept1,
        int256 yIntercept2,
        int256 yIntercept3,
        uint256 utilA,
        uint256 utilB
    );

    /// @notice Emitted when the collateral type IDs are set
    event SetCTypeIds(uint256[] cTypeIds);

    /// @notice Emitted when the interest rates are set
    event SetInterestRates();

    /// @notice Emitted when the interest rate is set for a collateral type
    event SetInterestRate(uint256 cTypeId, uint256 interestRate);

    /// @notice Emitted when the max or min interest rate is set
    event SetMaxMinInterestRates(uint256 maxInterestRate, uint256 minInterestRate);

    constructor(
        YSS stablecoin,
        CDPModule _cdpModule,
        PegStabilityModule _psm,
        PSMLockup _lockup
    ) YSSModule(stablecoin) {
        cdpModule = _cdpModule;
        psm = _psm;
        lockup = _lockup;
        externalStablecoin = psm.externalStablecoin();
        yssDecimals = psm.yssDecimals();
        externalDecimals = psm.externalDecimals();
    }

    /// @notice Called when collateral is deposited into a CDP and updates the interest rates
    /// @dev No need for access control as anyone can call setInterestRates()
    function handleCollateralDeposit(
        uint256 vaultId,
        uint256 amount
    ) external {
        vaultId;
        amount;
        try this.setInterestRates() {} catch {}
    }

    /// @notice Called when collateral is withdrawn from a CDP and updates the interest rates.
    /// @dev No need for access control as anyone can call setInterestRates()
    function handleCollateralWithdrawal(
        uint256 vaultId,
        uint256 amount
    ) external {
        vaultId;
        amount;
        try this.setInterestRates() {} catch {}
    }

    /// @notice Sets the collateral type IDs
    function setCTypeIds(uint256[] memory _cTypeIds) external onlyAllowlist {
        cTypeIds = _cTypeIds;
        emit SetCTypeIds(_cTypeIds);
    }

    /// @notice Sets the interest rate parameters for a CDP type
    function setCTypeInterestParams(
        SetCTypeInterestParamsArgs memory args
    ) external onlyAllowlist {
        require(0 < args.utilA, "InterestCollateralManager: utilA == 0");
        require(args.utilA < args.utilB, "InterestCollateralManager: utilA >= utilB");
        require(args.utilB < PRBMathUD60x18.scale(), "InterestCollateralManager: utilB >= 1");
        require(PRBMathUD60x18.scale() <= args.interestRateA, "InterestCollateralManager: interestRateA < 1");
        require(args.interestRateA <= args.interestRateB, "InterestCollateralManager: interestRateA > interestRateB");
        require(args.interestRateB <= args.interestRateC, "InterestCollateralManager: interestRateB > interestRateC");
        require(args.interestRateC <= args.interestRateD, "InterestCollateralManager: interestRateC > interestRateD");
        args.interestRateA = normalizeInterestRate(args.interestRateA);
        args.interestRateB = normalizeInterestRate(args.interestRateB);
        args.interestRateC = normalizeInterestRate(args.interestRateC);
        args.interestRateD = normalizeInterestRate(args.interestRateD);
        uint256 slope1 = (args.interestRateB - args.interestRateA).div(args.utilA);
        uint256 slope2 = (args.interestRateC - args.interestRateB).div(args.utilB - args.utilA);
        uint256 slope3 = (args.interestRateD - args.interestRateC).div(PRBMathUD60x18.scale() - args.utilB);
        int256 yIntercept1 = int256(args.interestRateA);
        int256 yIntercept2 = int256(args.interestRateB) - int256(slope2.mul(args.utilA));
        int256 yIntercept3 = int256(args.interestRateC) - int256(slope3.mul(args.utilB));
        cTypeInterestParams[args.cTypeId] = CTypeInterestParams({
            slope1: slope1,
            slope2: slope2,
            slope3: slope3,
            yIntercept1: yIntercept1,
            yIntercept2: yIntercept2,
            yIntercept3: yIntercept3,
            utilA: args.utilA,
            utilB: args.utilB
        });

        emit SetCTypeInterestParams(
            args.cTypeId,
            slope1,
            slope2,
            slope3,
            yIntercept1,
            yIntercept2,
            yIntercept3,
            args.utilA,
            args.utilB
        );
    }

    /// @notice Sets the min and max interest rates
    function setMinMaxInterestRates(
        uint256 _minInterestRate,
        uint256 _maxInterestRate
    ) external onlyAllowlist {
        require(_maxInterestRate >= _minInterestRate, "InterestCollateralManager: maxInterestRate < minInterestRate");
        maxInterestRate = _maxInterestRate;
        minInterestRate = _minInterestRate;
        emit SetMaxMinInterestRates(_maxInterestRate, _minInterestRate);
    }

    /// @notice Sets the interest rate based on the utilization ratio
    function setInterestRates() external {
        uint256 util = getUtilization();
        for (uint256 i = 0; i < cTypeIds.length; i++) {
            uint256 cTypeId = cTypeIds[i];
            cdpModule.updateInterest(cTypeId);
            CTypeInterestParams memory params = cTypeInterestParams[cTypeId];
            if (params.utilA == 0) continue; // If the params are not set, skip the collateral type
            uint256 interestRate = calculateInterest(params, util);
            setInterestRate(cTypeId, interestRate);
        }
        emit SetInterestRates();
    }

    /// @notice Calculates interest for a specific collateral type
    function calculateInterest(
        CTypeInterestParams memory params,
        uint256 util
    ) public pure returns (uint256 interestRate) {
        int256 result;
        if (util < params.utilA) {
            result = int256(params.slope1).mul(int256(util)) + params.yIntercept1;
        } else if (util < params.utilB) {
            result = int256(params.slope2).mul(int256(util)) + params.yIntercept2;
        } else {
            result = int256(params.slope3).mul(int256(util)) + params.yIntercept3;
        }

        if (result < 0) {
            interestRate = 0;
        } else {
            interestRate = uint256(result);
        }

        interestRate = denormalizeInterestRate(interestRate);
    }

    /// @notice Gets the utilization of the PSM (liquidity / total lent)
    function getUtilization() public view returns (uint256) {
        uint256 psmLiquidity = convertAmount(
            externalStablecoin.balanceOf(address(psm)),
            externalDecimals,
            yssDecimals
        );

        uint256 totalLent = lockup.totalSupply().mul(lockup.value());

        if (totalLent == 0) {
            return PRBMathUD60x18.scale();
        }

        if (psmLiquidity >= totalLent) {
            return 0;
        }

        return PRBMathUD60x18.scale() - psmLiquidity.div(totalLent);
    }

    /// @notice Normalizes an interest rate to be used in calculations
    function normalizeInterestRate(uint256 interestRate) public pure returns (uint256) {
        return (interestRate - PRBMathUD60x18.scale()) * 1e8;
    }

    /// @notice Denormalizes a calculated interest rate
    function denormalizeInterestRate(uint256 interestRate) public pure returns (uint256) {
        return (interestRate / 1e8) + PRBMathUD60x18.scale();
    }

    /// @notice Sets the interest rate for a specific collateral type
    function setInterestRate(uint256 collateralTypeId, uint256 interestRate) internal {
        if (interestRate > maxInterestRate) {
            interestRate = maxInterestRate;
        } else if (interestRate < minInterestRate) {
            interestRate = minInterestRate;
        }
        if (interestRate < PRBMathUD60x18.scale()) {
            return;
        }
        (
            ,
            IPriceSource priceSource,
            uint256 debtFloor,
            uint256 debtCeiling,
            uint256 collateralRatio,
            ,
            ,
            ,
            ,
            ,
            bool borrowingEnabled,
            bool allowlistEnabled
        ) = cdpModule.collateralTypes(collateralTypeId);
        cdpModule.setCollateralType(
            collateralTypeId,
            priceSource,
            debtFloor,
            debtCeiling,
            collateralRatio,
            interestRate,
            borrowingEnabled,
            allowlistEnabled
        );
        emit SetInterestRate(collateralTypeId, interestRate);
    }
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

import "./templates/YSSModuleExtended.sol";
import "../interfaces/IPriceSource.sol";
import "../interfaces/ICollateralManager.sol";
import "../interfaces/ILiquidator.sol";
import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import "@prb/math/contracts/PRBMathUD60x18.sol";
import "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";

/// @notice Manages the creation and maintenance of collateralized debt positions
/// (CDPs)
contract CDPModule is YSSModuleExtended {
  using SafeERC20 for IERC20;
  using PRBMathUD60x18 for uint256;

  struct Vault {
    uint256 collateralAmount;
    uint256 collateralTypeId;
    address owner;
    address altOwner;
    uint256 initialDebt;
    bool isLiquidated;
  }

  struct CollateralType {
    IERC20 token;
    IPriceSource priceSource;
    uint256 debtFloor;
    uint256 debtCeiling;
    uint256 collateralRatio;
    uint256 interestRate;  // Debt is multiplied by this value every second. 
    uint256 totalCollateral;
    uint256 lastUpdateTime;
    uint256 initialDebt;
    uint256 cumulativeInterest;
    bool borrowingEnabled;
    bool allowlistEnabled;
  }

  Vault[] public vaults;
  CollateralType[] public collateralTypes;

  /// @notice Called when collateral is added/removed from a vault
  /// @dev Allows governance to stake collateral to other protocols
  ICollateralManager public collateralManager;

  /// @notice A list of liquidators that can accept a liquidation
  ILiquidator[] public liquidators;

  bool public borrowingDisabled;

  mapping(uint256 collateralTypeId => mapping(address borrower => bool isAllowed)) allowedBorrowers;

  mapping(address account => uint256[] ownedVaults) public ownedVaults;

  /// @notice Emitted when a vault's debt is set
  /// @param account The account that owns the vault
  /// @param vaultId The vault's ID
  /// @param debt The new debt amount
  /// @param initialDebt The vault's initial debt amount
  event SetDebt(
    address indexed account,
    uint256 indexed vaultId,
    uint256 debt,
    uint256 initialDebt
  );

  /// @notice Emitted when an account borrows against a vault
  /// @param account The account that borrowed
  /// @param vaultId The vault's ID
  /// @param amount The amount borrowed
  event Borrow(
    address indexed account,
    uint256 indexed vaultId,
    uint256 amount
  );

  /// @notice Emitted when an account repays a vault's debt
  /// @param account The account that repaid
  /// @param vaultId The vault's ID
  /// @param amount The amount repaid
  event Repay(
    address indexed account,
    uint256 indexed vaultId,
    uint256 amount
  );

  /// @notice Emitted when an account adds collateral to a vault
  /// @param account The account that added collateral
  /// @param vaultId The vault's ID
  /// @param amount The amount of collateral added
  event AddCollateral(
    address indexed account,
    uint256 indexed vaultId,
    uint256 amount
  );

  /// @notice Emitted when an account removes collateral from a vault
  /// @param account The account that removed collateral
  /// @param vaultId The vault's ID
  /// @param amount The amount of collateral removed
  event RemoveCollateral(
    address indexed account,
    uint256 indexed vaultId,
    uint256 amount
  );

  /// @notice Emitted when a vault is created
  /// @param owner The account that owns the vault
  /// @param vaultId The vault's ID
  /// @param collateralTypeId The ID of the vault's collateral type
  /// @param collateralAmount The amount of collateral deposited
  /// @param altOwner Another account that can control the vault
  event CreateVault(
    address indexed owner,
    uint256 indexed vaultId,
    uint256 indexed collateralTypeId,
    uint256 collateralAmount,
    address altOwner
  );

  /// @notice Emitted when a vault is liquidated
  /// @param initiator The account that initiated the liquidation
  /// @param liquidated The account that owns the vault
  /// @param vaultId The vault's ID
  /// @param liquidator The account that liquidated the vault
  event Liquidate(
    address indexed initiator,
    address indexed liquidated,
    uint256 indexed vaultId,
    address liquidator
  );

  /// @notice Emitted when a collateral type is added
  /// @param collateralTypeId The ID of the collateral type
  /// @param token The collateral token
  /// @param priceSource The price source for the collateral token
  /// @param debtFloor The minimum amount of debt that can be borrowed
  /// @param debtCeiling The maximum amount of debt that can be borrowed
  /// @param collateralRatio The ratio of collateral to debt
  /// @param interestRate The interest rate for the collateral type
  /// @param borrowingEnabled Whether borrowing is enabled for the collateral type
  /// @param allowlistEnabled Whether the allowlist is enabled for the collateral type
  event AddCollateralType(
    uint256 indexed collateralTypeId,
    address indexed token,
    address priceSource,
    uint256 debtFloor,
    uint256 debtCeiling,
    uint256 collateralRatio,
    uint256 interestRate,
    bool borrowingEnabled,
    bool allowlistEnabled
  );

  /// @notice Emitted when a collateral type is updated
  /// @param collateralTypeId The ID of the collateral type
  /// @param token The collateral token
  /// @param priceSource The price source for the collateral token
  /// @param debtFloor The minimum amount of debt that can be borrowed
  /// @param debtCeiling The maximum amount of debt that can be borrowed
  /// @param collateralRatio The ratio of collateral to debt
  /// @param interestRate The interest rate for the collateral type
  /// @param borrowingEnabled Whether borrowing is enabled for the collateral type
  /// @param allowlistEnabled Whether the allowlist is enabled for the collateral type
  event SetCollateralType(
    uint256 indexed collateralTypeId,
    address indexed token,
    address priceSource,
    uint256 debtFloor,
    uint256 debtCeiling,
    uint256 collateralRatio,
    uint256 interestRate,
    bool borrowingEnabled,
    bool allowlistEnabled
  );

  /// @notice Emitted when a collateral type's interest rate is updated
  /// @param collateralTypeId The ID of the collateral type
  /// @param interestRate The interest rate for the collateral type
  /// @param lastUpdateTime The last time the interest rate was updated
  /// @param cumulativeInterest The cumulative interest
  event UpdateInterest(
    uint256 indexed collateralTypeId,
    uint256 interestRate,
    uint256 lastUpdateTime,
    uint256 cumulativeInterest
  );

  /// @notice Emitted when a liquidated vault is written off
  /// @param vaultId The vault's ID
  event ClearVault(uint256 indexed vaultId);

  /// @notice Verifies that msg.sender owns the vault
  /// @param vaultId The vault's ID
  modifier onlyVaultOwner(uint256 vaultId) {
    require(vaults[vaultId].owner == msg.sender
      || vaults[vaultId].altOwner == msg.sender, "Yama: Must be vault owner");
    _;
  }

  /// @notice Verifies that the vault is not liquidated
  /// @param vaultId The vault's ID
  modifier notLiquidated(uint256 vaultId) {
    require(!vaults[vaultId].isLiquidated, "Yama: Vault already liquidated");
    _;
  }

  /// @notice Initializes the module
  /// @param _stablecoin The YSS contract
  /// @param _balanceSheet The BalanceSheet contract
  /// @param _collateralManager The CollateralManager contract
  constructor(
    YSS _stablecoin,
    BalanceSheetModule _balanceSheet,
    ICollateralManager _collateralManager
  ) YSSModuleExtended(_stablecoin, _balanceSheet) {
    setCollateralManager(_collateralManager);
  }

  /// @notice Creates a vault
  /// @param collateralTypeId The ID of the vault's collateral type
  /// @param collateralAmount The amount of collateral to deposit
  /// @param altOwner Another account that can control the vault
  /// @return vaultId The vault's ID
  function createVault(
    uint256 collateralTypeId,
    uint256 collateralAmount,
    address altOwner
  ) external returns (uint256 vaultId) {
    Vault memory vault;
    vault.collateralTypeId = collateralTypeId;
    vault.owner = msg.sender;
    vault.altOwner = altOwner;
    vaults.push(vault);
    vaultId = vaults.length - 1;

    ownedVaults[msg.sender].push(vaultId);
    if (altOwner != address(0)) {
      ownedVaults[altOwner].push(vaultId);
    }

    emit CreateVault(
      msg.sender,
      vaultId,
      collateralTypeId,
      collateralAmount,
      altOwner
    );
    addCollateral(vaultId, collateralAmount);
  }

  /// @notice Liquidates a vault
  /// @param vaultId The vault's ID
  function liquidate(uint256 vaultId) notLiquidated(vaultId) external {
    Vault storage vault = vaults[vaultId];
    updateInterest(vault.collateralTypeId);
    require(underCollateralized(vaultId), "Yama: Vault not undercollateralized");
    for (uint256 i = 0; i < liquidators.length; i++) {
      if (liquidators[i].liquidate(vaultId)) {
        vault.isLiquidated = true;
        emit Liquidate(
          msg.sender,
          vault.owner,
          vaultId,
          address(liquidators[i])
        );
        return;
      }
    }
    revert("Yama: No liquidator accepted the liquidation");
  }

  /// @notice Used by allowlist contracts to transfer tokens out
  /// @param token The token to transfer
  /// @param to The recipient
  /// @param amount The amount to transfer
  function transfer(
    IERC20 token,
    address to,
    uint256 amount
  ) external onlyAllowlist {
    token.safeTransfer(to, amount);
  }
  
  /// @notice Adds a collateral type
  /// @param token The collateral token
  /// @param priceSource The price source for the collateral token
  /// @param debtFloor The minimum amount of debt that can be borrowed for each vault
  /// @param debtCeiling The maximum amount of debt that can be borrowed by everyone cumulatively
  /// @param collateralRatio The ratio of collateral to debt
  /// @param interestRate The interest rate for the collateral type
  /// @param borrowingEnabled Whether borrowing is enabled for the collateral type
  /// @param allowlistEnabled Whether the allowlist is enabled for the collateral type
  /// @return collateralTypeId The ID of the new collateral type
  function addCollateralType(
    IERC20 token,
    IPriceSource priceSource,
    uint256 debtFloor,
    uint256 debtCeiling,
    uint256 collateralRatio,
    uint256 interestRate,
    bool borrowingEnabled,
    bool allowlistEnabled
  ) external onlyAllowlist returns (uint256 collateralTypeId) {
    CollateralType memory newCollateralType = CollateralType(
      token,
      priceSource,
      debtFloor,
      debtCeiling,
      collateralRatio,
      interestRate,
      0,
      block.timestamp,
      0,
      PRBMathUD60x18.SCALE,
      borrowingEnabled,
      allowlistEnabled
    );
    collateralTypes.push(newCollateralType);
    collateralTypeId = collateralTypes.length - 1;
    emit AddCollateralType(
      collateralTypeId,
      address(token),
      address(priceSource),
      debtFloor,
      debtCeiling,
      collateralRatio,
      interestRate,
      borrowingEnabled,
      allowlistEnabled
    );
  }

  /// @notice Sets a collateral type's parameters
  /// @param collateralTypeId The ID of the collateral type
  /// @param priceSource The price source for the collateral token
  /// @param debtFloor The minimum amount of debt that can be borrowed for each vault
  /// @param debtCeiling The maximum amount of debt that can be borrowed by everyone cumulatively
  /// @param collateralRatio The ratio of collateral to debt
  /// @param interestRate The interest rate for the collateral type
  /// @param borrowingEnabled Whether borrowing is enabled for the collateral type
  /// @param allowlistEnabled Whether the allowlist is enabled for the collateral type
  function setCollateralType(
    uint256 collateralTypeId,
    IPriceSource priceSource,
    uint256 debtFloor,
    uint256 debtCeiling,
    uint256 collateralRatio,
    uint256 interestRate,
    bool borrowingEnabled,
    bool allowlistEnabled
  ) external onlyAllowlist {
    CollateralType storage newCollateralType
      = collateralTypes[collateralTypeId];
    newCollateralType.priceSource = priceSource;
    newCollateralType.debtFloor = debtFloor;
    newCollateralType.debtCeiling = debtCeiling;
    newCollateralType.collateralRatio = collateralRatio;
    newCollateralType.interestRate = interestRate;
    newCollateralType.borrowingEnabled = borrowingEnabled;
    newCollateralType.allowlistEnabled = allowlistEnabled;
    emit SetCollateralType(
      collateralTypeId,
      address(newCollateralType.token),
      address(priceSource),
      debtFloor,
      debtCeiling,
      collateralRatio,
      interestRate,
      borrowingEnabled,
      allowlistEnabled
    );
  }

  /// @notice Sets an allowed borrower for a vault
  /// @param collateralTypeId The ID of the collateral type
  /// @param borrower The borrower
  /// @param isAllowed Whether the borrower is allowed
  function setAllowedBorrower(
    uint256 collateralTypeId, address borrower, bool isAllowed
  ) external onlyAllowlist {
    allowedBorrowers[collateralTypeId][borrower] = isAllowed;
  }

  /// @notice Borrows from a vault
  /// @param vaultId The vault's ID
  /// @param amount The amount to borrow
  function borrow(
    uint256 vaultId,
    uint256 amount
  ) external onlyVaultOwner(vaultId) notLiquidated(vaultId) {
    require(!borrowingDisabled, "Yama: Borrowing disabled");
    CollateralType storage cType = getCollateralType(vaultId);
    uint256 cTypeId = vaults[vaultId].collateralTypeId;
    require(cType.borrowingEnabled, "Yama: Collateral type disabled");
    if (cType.allowlistEnabled) {
      require(allowedBorrowers[cTypeId][msg.sender],
        "Yama: Not allowed borrower");
    }
    updateInterest(cTypeId);
    uint256 newDebt = getDebt(vaultId) + amount;
    requireValidDebtAmount(vaultId, newDebt);

    setDebt(vaultId, newDebt);

    require(getTotalDebt(cTypeId)
      <= cType.debtCeiling, "Yama: Debt ceiling exceeded");
    stablecoin.mint(msg.sender, amount);

    emit Borrow(msg.sender, vaultId, amount);
  }

  /// @notice Repays a vault
  /// @param vaultId The vault's ID
  /// @param amount The amount to repay
  function repay(
    uint256 vaultId,
    uint256 amount
  ) external onlyVaultOwner(vaultId) notLiquidated(vaultId) {
    updateInterest(vaults[vaultId].collateralTypeId);
    uint256 newDebt = getDebt(vaultId) - amount;
    requireValidDebtAmount(vaultId, newDebt);
    stablecoin.burn(msg.sender, amount);
    setDebt(vaultId, newDebt);

    emit Repay(msg.sender, vaultId, amount);
  }

  /// @notice Removes collateral from a vault
  /// @param vaultId The vault's ID
  /// @param amount The amount to remove
  function removeCollateral(
    uint256 vaultId,
    uint256 amount
  ) external onlyVaultOwner(vaultId) notLiquidated(vaultId) {
    updateInterest(vaults[vaultId].collateralTypeId);
    collateralManager.handleCollateralWithdrawal(vaultId, amount);
    vaults[vaultId].collateralAmount -= amount;
    getCollateralType(vaultId).totalCollateral -= amount;
    require(!underCollateralized(vaultId), "Yama: Vault undercollateralized");
    getCollateralType(vaultId).token.safeTransfer(msg.sender, amount);

    emit RemoveCollateral(msg.sender, vaultId, amount);
  }

  /// @notice Used to write off liquidated vaults
  /// @dev Sets collateral to 0 and debt to 0, doesn't call balance sheet
  /// @param vaultId The vault's ID
  function clearVault(uint256 vaultId) external onlyAllowlist {
    Vault storage vault = vaults[vaultId];
    updateInterest(vault.collateralTypeId);
    CollateralType storage cType = getCollateralType(vaultId);
    collateralManager.handleCollateralWithdrawal(
      vaultId, vault.collateralAmount);
    cType.totalCollateral -= vault.collateralAmount;
    vault.collateralAmount = 0;
    setDebt(vaultId, 0);

    emit ClearVault(vaultId);
  }

  /// @notice Sets the liquidators for this module
  /// @param _liquidators The liquidators
  function setLiquidators(
    ILiquidator[] memory _liquidators
  ) external onlyAllowlist {
    liquidators = _liquidators;
  }

  /// @notice Used to enable/disable borrowing.
  /// @param value Whether to enable/disable borrowing
  function setBorrowingDisabled(
    bool value
  ) external onlyAllowlist {
    borrowingDisabled = value;
  }

  /// @notice Determines if a vault has been liquidated
  /// @param vaultId The vault's ID
  function isLiquidated(uint256 vaultId) external view returns (bool) {
    return vaults[vaultId].isLiquidated;
  }

  /// @notice Gets annual interest for a collateral type
  /// @dev Assumes 31536000 seconds in a year
  /// @param collateralTypeId The ID of the collateral type
  /// @return annualInterest The annual interest rate
  function getAnnualInterest(
    uint256 collateralTypeId
  ) external view returns (uint256 annualInterest) {
    return collateralTypes[collateralTypeId].interestRate.powu(31536000);
  }

  /// @notice Gets per-second interest for a collateral type
  /// @param collateralTypeId The ID of the collateral type
  /// @return psInterest The per-second interest rate
  function getPsInterest(
    uint256 collateralTypeId
  ) external view returns (uint256 psInterest) {
    return collateralTypes[collateralTypeId].interestRate;
  }

  /// @notice Obtains the collateralization ratio for a collateral type
  /// @param collateralTypeId The ID of the collateral type
  /// @return collateralRatio The collateralization ratio
  function getCollateralRatio(
    uint256 collateralTypeId
  ) external view returns (uint256 collateralRatio) {
    CollateralType storage cType = collateralTypes[collateralTypeId];
    return cType.collateralRatio;
  }

  /// @notice Obtains the debt floor for a collateral type
  /// @param collateralTypeId The ID of the collateral type
  /// @return debtFloor The debt floor
  function getDebtFloor(
    uint256 collateralTypeId
  ) external view returns (uint256 debtFloor) {
    return collateralTypes[collateralTypeId].debtFloor;
  }

  /// @notice Obtains the debt ceiling for a collateral type
  /// @param collateralTypeId The ID of the collateral type
  /// @return debtCeiling The debt ceiling
  function getDebtCeiling(
    uint256 collateralTypeId
  ) external view returns (uint256 debtCeiling) {
    return collateralTypes[collateralTypeId].debtCeiling;
  }

  /// @notice Gets the vaults owned by an address
  /// @param owner The owner's address
  /// @return ownedVaults_ The vaults owned by the address
  function getOwnedVaults(
    address owner
  ) external view returns (uint256[] memory ownedVaults_) {
    return ownedVaults[owner];
  }

  /// @notice Gets the owner of a vault
  /// @param vaultId The vault's ID
  /// @return owner The owner's address
  function getOwner(
    uint256 vaultId
  ) external view returns (address owner) {
    return vaults[vaultId].owner;
  }

  /// @notice Gets the alternate owner of a vault
  /// @param vaultId The vault's ID
  /// @return altOwner The alternate owner's address
  function getAltOwner(
    uint256 vaultId
  ) external view returns (address altOwner) {
    return vaults[vaultId].altOwner;
  }

  /// @notice Returns the collateral type ID for a vault
  /// @param vaultId The vault's ID
  /// @return collateralTypeId The collateral type ID
  function getCollateralTypeId(
    uint256 vaultId
  ) external view returns (uint256 collateralTypeId) {
    return vaults[vaultId].collateralTypeId;
  }

  /// @notice Returns the collateral token for a vault
  /// @param vaultId The vault's ID
  /// @return collateralToken The collateral token
  function getCollateralToken(
    uint256 vaultId
  ) external view returns (IERC20 collateralToken) {
    return getCollateralType(vaultId).token;
  }


  /// @notice Adds collateral to a vault
  /// @param vaultId The vault's ID
  /// @param amount The amount of collateral to add
  function addCollateral(
    uint256 vaultId,
    uint256 amount
  ) public onlyVaultOwner(vaultId) notLiquidated(vaultId) {
    getCollateralType(vaultId).token.safeTransferFrom(
      msg.sender,
      address(this),
      amount
    );
    vaults[vaultId].collateralAmount += amount;
    getCollateralType(vaultId).totalCollateral += amount;
    collateralManager.handleCollateralDeposit(vaultId, amount);

    emit AddCollateral(msg.sender, vaultId, amount);
  }

  /// @notice Sets the collateral manager
  /// @param _collateralManager The collateral manager
  function setCollateralManager(
    ICollateralManager _collateralManager
  ) public onlyAllowlist {
    collateralManager = _collateralManager;
  }

  /// @notice Determines a vault's debt
  /// @param vaultId The vault's ID
  /// @return debt The vault's debt
  function getDebt(uint256 vaultId) public view returns (uint256 debt) {
    return vaults[vaultId].initialDebt.mul(
      getCollateralType(vaultId).cumulativeInterest);
  }

  /// @notice Obtains the total debt for a collateral type
  /// @param collateralTypeId The ID of the collateral type
  /// @return totalDebt The total debt
  function getTotalDebt(
    uint256 collateralTypeId
  ) public view returns (uint256 totalDebt) {
    CollateralType storage cType = collateralTypes[collateralTypeId];
    return cType.initialDebt.mul(cType.cumulativeInterest);
  }

  /// @notice Updates interest for a collateral type
  /// @param collateralTypeId The ID of the collateral type
  function updateInterest(uint256 collateralTypeId) public {
    CollateralType storage cType = collateralTypes[collateralTypeId];
    uint256 timeDelta = block.timestamp - cType.lastUpdateTime;

    if (timeDelta == 0) {
      return;
    }
    uint256 oldTotalDebt = getTotalDebt(collateralTypeId);
    cType.cumulativeInterest = cType.cumulativeInterest.mul(
      cType.interestRate.powu(timeDelta));

    emit UpdateInterest(
      collateralTypeId,
      cType.interestRate,
      cType.lastUpdateTime,
      cType.cumulativeInterest
    );

    cType.lastUpdateTime = block.timestamp;

    balanceSheet.addSurplus((int256(getTotalDebt(collateralTypeId))
      - int256(oldTotalDebt)));
  }

  /// @notice Returns the collateral amount for a vault
  /// @param vaultId The vault's ID
  /// @return collateralAmount The collateral amount
  function getCollateralAmount(
    uint256 vaultId
  ) public view returns (uint256 collateralAmount) {
    return vaults[vaultId].collateralAmount;
  }

  /// @notice Returns the per-unit price of the vault's collateral
  /// @param vaultId The vault's ID
  /// @return price The collateral price
  function getCollateralPrice(
    uint256 vaultId
  ) public view returns (uint256 price) {
    price = getCollateralType(vaultId).priceSource.price();
  }

  /// @notice Returns the value of a vault's collateral
  /// @param vaultId The vault's ID
  /// @return collateralValue The collateral value
  function getCollateralValue(uint256 vaultId) public view returns (uint256) {
    return getCollateralAmount(vaultId).mul(getCollateralPrice(vaultId));
  }

  /// @notice Multiplies the debt by the collateral ratio for a vault
  /// @param vaultId The vault's ID
  /// @return targetCollateralValue The target collateral value
  function getTargetCollateralValue(
    uint256 vaultId
  ) public view returns (uint256 targetCollateralValue) {
    return getDebt(vaultId).mul(getCollateralType(vaultId).collateralRatio);
  }

  /// @notice Determines if a vault is undercollateralized
  /// @param vaultId The vault's ID
  /// @return undercollateralized True if the vault is undercollateralized
  function underCollateralized(uint256 vaultId) public view returns (bool) {
    return getCollateralValue(vaultId) < getTargetCollateralValue(vaultId);
  }

  /// @notice Sets the debt for a vault
  /// @param vaultId The vault's ID
  /// @param newDebt The new debt
  function setDebt(uint256 vaultId, uint256 newDebt) internal {
    CollateralType storage cType = getCollateralType(vaultId);
    uint256 oldInitialDebt = vaults[vaultId].initialDebt;
    uint256 newInitialDebt = newDebt.div(cType.cumulativeInterest);
    vaults[vaultId].initialDebt = newInitialDebt;

    cType.initialDebt = cType.initialDebt + newInitialDebt - oldInitialDebt;
    emit SetDebt(msg.sender, vaultId, newDebt, newInitialDebt);
  }

  /// @notice Returns the collateral type object for a specific vault
  /// @param vaultId The vault's ID
  /// @return cType The collateral type object
  function getCollateralType(
    uint256 vaultId
  ) internal view returns (CollateralType storage cType) {
    return collateralTypes[vaults[vaultId].collateralTypeId];
  }

  /// @notice Reverts if the debt amount is invalid.
  /// @param vaultId The vault's ID
  /// @param amount The debt amount
  function requireValidDebtAmount(
    uint256 vaultId,
    uint256 amount
  ) internal view {
    require(validDebtAmount(vaultId, amount), "Yama: Invalid debt amount");
  }

  /// @notice Determines if the debt amount is valid.
  /// @param vaultId The vault's ID
  /// @param amount The debt amount
  /// @return isValidDebtAmount True if the debt amount is valid
  function validDebtAmount(
    uint256 vaultId,
    uint256 amount
  ) internal view returns (bool isValidDebtAmount) {
    return (
      amount == 0 ||
      (amount >= getCollateralType(vaultId).debtFloor
       && !underCollateralizedWithNewDebt(vaultId, amount)));
  }

  /// @notice Determines if a vault is undercollateralized with a new debt amount
  /// @param vaultId The vault's ID
  /// @param amount The debt amount
  /// @return isUnderCollateralized True if the vault is undercollateralized
  function underCollateralizedWithNewDebt(
    uint256 vaultId,
    uint256 amount
  ) internal view returns (bool isUnderCollateralized) {
    return getCollateralValue(vaultId) < getTargetCollateralValueWithNewDebt(vaultId, amount);
  }

  /// @notice Multiplies the debt by the collateral ratio for a vault with a new debt amount
  /// @param vaultId The vault's ID
  /// @param amount The debt amount
  /// @return targetCollateralValue The target collateral value
  function getTargetCollateralValueWithNewDebt(
    uint256 vaultId,
    uint256 amount
  ) internal view returns (uint256 targetCollateralValue) {
    return amount.mul(getCollateralType(vaultId).collateralRatio);
  }
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

import "src/modules/templates/YSSModule.sol";
import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";

/// @notice Converts YSS to/from an external stablecoin to stabilize the peg.
contract PegStabilityModule is YSSModule {
  using SafeERC20 for IERC20;

  IERC20 public immutable externalStablecoin;

  /// @notice Maximum amount of external stablecoin that can be held
  uint256 public debtCeiling;

  // Remembering the tokens' decimals is more gas-efficient and reliable than
  // calling decimals() on the tokens.
  uint8 public immutable yssDecimals;
  uint8 public immutable externalDecimals;

  /// @notice Emitted when the debt ceiling is set
  /// @param account Account that set the debt ceiling
  /// @param debtCeiling New debt ceiling
  event SetDebtCeiling(address indexed account, uint256 debtCeiling);

  /// @notice Emitted when the external stablecoin is deposited
  /// @param account Account that deposited the external stablecoin
  /// @param extStableAmount Amount of external stablecoin deposited
  event Deposit(address indexed account, uint256 extStableAmount);

  /// @notice Emitted when the external stablecoin is withdrawn
  /// @param account Account that withdrew the external stablecoin
  /// @param yssAmount Amount of YSS withdrawn
  event Withdraw(address indexed account, uint256 yssAmount);

  /// @notice Initializes the PSM
  /// @param _stablecoin YSS token
  /// @param _externalStablecoin External stablecoin
  /// @param _debtCeiling Maximum amount of external stablecoin that can be held
  /// @param _yssDecimals Number of decimals of YSS
  /// @param _externalDecimals Number of decimals of external stablecoin
  constructor(
    YSS _stablecoin,
    IERC20 _externalStablecoin,
    uint256 _debtCeiling,
    uint8 _yssDecimals,
    uint8 _externalDecimals
  ) YSSModule(_stablecoin) {
    externalStablecoin = _externalStablecoin;
    setDebtCeiling(_debtCeiling);
    yssDecimals = _yssDecimals;
    externalDecimals = _externalDecimals;
  }

  /// @notice Used by allowlist contracts to transfer tokens out
  /// @param token Token to transfer
  /// @param to Recipient of the tokens
  /// @param amount Amount of tokens to transfer
  function transfer(
    IERC20 token,
    address to,
    uint256 amount
  ) external onlyAllowlist {
    token.safeTransfer(to, amount);
  }

  /// @notice Deposits the external stablecoin in exchange for YSS.
  /// @param extStableAmount Amount of external stablecoin to deposit
  /// @return yssAmount Amount of YSS minted
  function deposit(uint256 extStableAmount) external returns (uint256 yssAmount) {
    externalStablecoin.safeTransferFrom(msg.sender, address(this), extStableAmount);
    yssAmount = convertAmount(
      extStableAmount,
      externalDecimals,
      yssDecimals
    );
    stablecoin.mint(msg.sender, yssAmount);
    require(externalStablecoin.balanceOf(address(this)) <= debtCeiling,
      "Yama: PSM exceeds debt ceiling");
    emit Deposit(msg.sender, extStableAmount);
  }

  /// @notice Withdraws the external stablecoin by burning YSS.
  /// @param yssAmount Amount of YSS to burn
  /// @return extStableAmount Amount of external stablecoin withdrawn
  function withdraw(uint256 yssAmount) external returns (uint256 extStableAmount) {
    stablecoin.burn(msg.sender, yssAmount);
    extStableAmount = convertAmount(
      yssAmount,
      yssDecimals,
      externalDecimals
    );
    require(externalStablecoin.balanceOf(address(this)) >= extStableAmount,
      "Yama: PSM reserves insufficient");
    externalStablecoin.safeTransfer(msg.sender, extStableAmount);
    emit Withdraw(msg.sender, yssAmount);
  }

  /// @notice Sets the debt ceiling
  /// @param _debtCeiling New debt ceiling
  function setDebtCeiling(uint256 _debtCeiling) public onlyAllowlist {
    debtCeiling = _debtCeiling;
    emit SetDebtCeiling(msg.sender, debtCeiling);
  }
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

import "../modules/templates/YSSModule.sol";
import "../modules/PegStabilityModule.sol";
import "./SimpleBSH.sol";
import "@openzeppelin/contracts/token/ERC20/ERC20.sol";
import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/token/ERC20/utils/SafeERC20.sol";
import "@prb/math/contracts/PRBMathUD60x18.sol";

/// @notice Incentivizes locking up an external stablecoin in the PSM
contract PSMLockup is YSSModule, ERC20 {
  using SafeERC20 for IERC20;
  using SafeERC20 for YSS;
  using PRBMathUD60x18 for uint256;

  SimpleBSH public bsh;
  PegStabilityModule public immutable psm;
  IERC20 public immutable psmToken;

  /// @notice Emitted when the external stablecoin is locked up
  /// @param account Account that locked up money
  /// @param extStableAmount Amount of external stablecoin locked up
  /// @param yamaAmount Amount of YSS locked up
  /// @param lockupAmount Amount of PSMLockup tokens minted
  event Lockup(
    address indexed account,
    uint256 extStableAmount,
    uint256 yamaAmount,
    uint256 lockupAmount
  );

  /// @notice Emitted when the external stablecoin is withdrawn
  /// @param account Account that withdrew money
  /// @param yamaAmount Amount of YSS withdrawn
  /// @param lockupAmount Amount of PSMLockup tokens burned
  event Withdraw(
    address indexed account,
    uint256 yamaAmount,
    uint256 lockupAmount
  );

  /// @notice Initializes the PSMLockup
  /// @param _stablecoin YSS token
  /// @param _psm PSM contract
  /// @param _psmToken Token used in the PSM
  /// @param name Name of the PSMLockup token
  /// @param symbol Symbol of the PSMLockup token
  constructor(
    YSS _stablecoin,
    PegStabilityModule _psm,
    IERC20 _psmToken,
    string memory name,
    string memory symbol
  ) YSSModule(_stablecoin) ERC20(name, symbol) {
    psm = _psm;
    psmToken = _psmToken;
  }

  /// @notice Sets the BSH contract
  /// @param _bsh BSH contract
  function setBSH(SimpleBSH _bsh) external onlyAllowlist {
    bsh = _bsh;
  }

  /// @notice Lock up the external stablecoin in the PSM
  /// @param extStableAmount Amount of external stablecoin to lock up
  /// @return lockupAmount Amount of PSMLockup tokens minted
  function lockup(uint256 extStableAmount) external returns (uint256 lockupAmount) {
    if (address(bsh) != address(0)) {
      bsh.processPendingShareAmount();
    }
    psmToken.safeTransferFrom(msg.sender, address(this), extStableAmount);
    psmToken.safeIncreaseAllowance(address(psm), extStableAmount);
    uint256 savedValue = value();
    uint256 yamaAmount = psm.deposit(extStableAmount);
    lockupAmount = yamaAmount.div(savedValue);
    _mint(msg.sender, lockupAmount);
    emit Lockup(
      msg.sender,
      extStableAmount,
      yamaAmount,
      lockupAmount
    );
  }

  /// @notice Withdraw the external stablecoin from the PSM
  /// @param lockupAmount Amount of PSMLockup tokens to burn
  /// @return yamaAmount Amount of YSS withdrawn
  function withdraw(uint256 lockupAmount) external returns (uint256 yamaAmount) {
    yamaAmount = lockupAmount.mul(value());
    _burn(msg.sender, lockupAmount);
    stablecoin.safeTransfer(msg.sender, yamaAmount);
    emit Withdraw(
      msg.sender,
      yamaAmount,
      lockupAmount
    );
  }

  /// @notice Returns the value of the lockup token (how much YAMA given upon
  /// redemption)
  /// @return value_ Value of the lockup token
  function value() public view returns (uint256 value_) {
    if (totalSupply() == 0) {
      return PRBMathUD60x18.SCALE;
    } else {
      return stablecoin.balanceOf(address(this)).div(totalSupply());
    }
  }
}

// SPDX-License-Identifier: Unlicense
pragma solidity >=0.8.4;

import "./PRBMath.sol";

/// @title PRBMathUD60x18
/// @author Paul Razvan Berg
/// @notice Smart contract library for advanced fixed-point math that works with uint256 numbers considered to have 18
/// trailing decimals. We call this number representation unsigned 60.18-decimal fixed-point, since there can be up to 60
/// digits in the integer part and up to 18 decimals in the fractional part. The numbers are bound by the minimum and the
/// maximum values permitted by the Solidity type uint256.
library PRBMathUD60x18 {
    /// @dev Half the SCALE number.
    uint256 internal constant HALF_SCALE = 5e17;

    /// @dev log2(e) as an unsigned 60.18-decimal fixed-point number.
    uint256 internal constant LOG2_E = 1_442695040888963407;

    /// @dev The maximum value an unsigned 60.18-decimal fixed-point number can have.
    uint256 internal constant MAX_UD60x18 =
        115792089237316195423570985008687907853269984665640564039457_584007913129639935;

    /// @dev The maximum whole value an unsigned 60.18-decimal fixed-point number can have.
    uint256 internal constant MAX_WHOLE_UD60x18 =
        115792089237316195423570985008687907853269984665640564039457_000000000000000000;

    /// @dev How many trailing decimals can be represented.
    uint256 internal constant SCALE = 1e18;

    /// @notice Calculates the arithmetic average of x and y, rounding down.
    /// @param x The first operand as an unsigned 60.18-decimal fixed-point number.
    /// @param y The second operand as an unsigned 60.18-decimal fixed-point number.
    /// @return result The arithmetic average as an unsigned 60.18-decimal fixed-point number.
    function avg(uint256 x, uint256 y) internal pure returns (uint256 result) {
        // The operations can never overflow.
        unchecked {
            // The last operand checks if both x and y are odd and if that is the case, we add 1 to the result. We need
            // to do this because if both numbers are odd, the 0.5 remainder gets truncated twice.
            result = (x >> 1) + (y >> 1) + (x & y & 1);
        }
    }

    /// @notice Yields the least unsigned 60.18 decimal fixed-point number greater than or equal to x.
    ///
    /// @dev Optimized for fractional value inputs, because for every whole value there are (1e18 - 1) fractional counterparts.
    /// See https://en.wikipedia.org/wiki/Floor_and_ceiling_functions.
    ///
    /// Requirements:
    /// - x must be less than or equal to MAX_WHOLE_UD60x18.
    ///
    /// @param x The unsigned 60.18-decimal fixed-point number to ceil.
    /// @param result The least integer greater than or equal to x, as an unsigned 60.18-decimal fixed-point number.
    function ceil(uint256 x) internal pure returns (uint256 result) {
        if (x > MAX_WHOLE_UD60x18) {
            revert PRBMathUD60x18__CeilOverflow(x);
        }
        assembly {
            // Equivalent to "x % SCALE" but faster.
            let remainder := mod(x, SCALE)

            // Equivalent to "SCALE - remainder" but faster.
            let delta := sub(SCALE, remainder)

            // Equivalent to "x + delta * (remainder > 0 ? 1 : 0)" but faster.
            result := add(x, mul(delta, gt(remainder, 0)))
        }
    }

    /// @notice Divides two unsigned 60.18-decimal fixed-point numbers, returning a new unsigned 60.18-decimal fixed-point number.
    ///
    /// @dev Uses mulDiv to enable overflow-safe multiplication and division.
    ///
    /// Requirements:
    /// - The denominator cannot be zero.
    ///
    /// @param x The numerator as an unsigned 60.18-decimal fixed-point number.
    /// @param y The denominator as an unsigned 60.18-decimal fixed-point number.
    /// @param result The quotient as an unsigned 60.18-decimal fixed-point number.
    function div(uint256 x, uint256 y) internal pure returns (uint256 result) {
        result = PRBMath.mulDiv(x, SCALE, y);
    }

    /// @notice Returns Euler's number as an unsigned 60.18-decimal fixed-point number.
    /// @dev See https://en.wikipedia.org/wiki/E_(mathematical_constant).
    function e() internal pure returns (uint256 result) {
        result = 2_718281828459045235;
    }

    /// @notice Calculates the natural exponent of x.
    ///
    /// @dev Based on the insight that e^x = 2^(x * log2(e)).
    ///
    /// Requirements:
    /// - All from "log2".
    /// - x must be less than 133.084258667509499441.
    ///
    /// @param x The exponent as an unsigned 60.18-decimal fixed-point number.
    /// @return result The result as an unsigned 60.18-decimal fixed-point number.
    function exp(uint256 x) internal pure returns (uint256 result) {
        // Without this check, the value passed to "exp2" would be greater than 192.
        if (x >= 133_084258667509499441) {
            revert PRBMathUD60x18__ExpInputTooBig(x);
        }

        // Do the fixed-point multiplication inline to save gas.
        unchecked {
            uint256 doubleScaleProduct = x * LOG2_E;
            result = exp2((doubleScaleProduct + HALF_SCALE) / SCALE);
        }
    }

    /// @notice Calculates the binary exponent of x using the binary fraction method.
    ///
    /// @dev See https://ethereum.stackexchange.com/q/79903/24693.
    ///
    /// Requirements:
    /// - x must be 192 or less.
    /// - The result must fit within MAX_UD60x18.
    ///
    /// @param x The exponent as an unsigned 60.18-decimal fixed-point number.
    /// @return result The result as an unsigned 60.18-decimal fixed-point number.
    function exp2(uint256 x) internal pure returns (uint256 result) {
        // 2^192 doesn't fit within the 192.64-bit format used internally in this function.
        if (x >= 192e18) {
            revert PRBMathUD60x18__Exp2InputTooBig(x);
        }

        unchecked {
            // Convert x to the 192.64-bit fixed-point format.
            uint256 x192x64 = (x << 64) / SCALE;

            // Pass x to the PRBMath.exp2 function, which uses the 192.64-bit fixed-point number representation.
            result = PRBMath.exp2(x192x64);
        }
    }

    /// @notice Yields the greatest unsigned 60.18 decimal fixed-point number less than or equal to x.
    /// @dev Optimized for fractional value inputs, because for every whole value there are (1e18 - 1) fractional counterparts.
    /// See https://en.wikipedia.org/wiki/Floor_and_ceiling_functions.
    /// @param x The unsigned 60.18-decimal fixed-point number to floor.
    /// @param result The greatest integer less than or equal to x, as an unsigned 60.18-decimal fixed-point number.
    function floor(uint256 x) internal pure returns (uint256 result) {
        assembly {
            // Equivalent to "x % SCALE" but faster.
            let remainder := mod(x, SCALE)

            // Equivalent to "x - remainder * (remainder > 0 ? 1 : 0)" but faster.
            result := sub(x, mul(remainder, gt(remainder, 0)))
        }
    }

    /// @notice Yields the excess beyond the floor of x.
    /// @dev Based on the odd function definition https://en.wikipedia.org/wiki/Fractional_part.
    /// @param x The unsigned 60.18-decimal fixed-point number to get the fractional part of.
    /// @param result The fractional part of x as an unsigned 60.18-decimal fixed-point number.
    function frac(uint256 x) internal pure returns (uint256 result) {
        assembly {
            result := mod(x, SCALE)
        }
    }

    /// @notice Converts a number from basic integer form to unsigned 60.18-decimal fixed-point representation.
    ///
    /// @dev Requirements:
    /// - x must be less than or equal to MAX_UD60x18 divided by SCALE.
    ///
    /// @param x The basic integer to convert.
    /// @param result The same number in unsigned 60.18-decimal fixed-point representation.
    function fromUint(uint256 x) internal pure returns (uint256 result) {
        unchecked {
            if (x > MAX_UD60x18 / SCALE) {
                revert PRBMathUD60x18__FromUintOverflow(x);
            }
            result = x * SCALE;
        }
    }

    /// @notice Calculates geometric mean of x and y, i.e. sqrt(x * y), rounding down.
    ///
    /// @dev Requirements:
    /// - x * y must fit within MAX_UD60x18, lest it overflows.
    ///
    /// @param x The first operand as an unsigned 60.18-decimal fixed-point number.
    /// @param y The second operand as an unsigned 60.18-decimal fixed-point number.
    /// @return result The result as an unsigned 60.18-decimal fixed-point number.
    function gm(uint256 x, uint256 y) internal pure returns (uint256 result) {
        if (x == 0) {
            return 0;
        }

        unchecked {
            // Checking for overflow this way is faster than letting Solidity do it.
            uint256 xy = x * y;
            if (xy / x != y) {
                revert PRBMathUD60x18__GmOverflow(x, y);
            }

            // We don't need to multiply by the SCALE here because the x*y product had already picked up a factor of SCALE
            // during multiplication. See the comments within the "sqrt" function.
            result = PRBMath.sqrt(xy);
        }
    }

    /// @notice Calculates 1 / x, rounding toward zero.
    ///
    /// @dev Requirements:
    /// - x cannot be zero.
    ///
    /// @param x The unsigned 60.18-decimal fixed-point number for which to calculate the inverse.
    /// @return result The inverse as an unsigned 60.18-decimal fixed-point number.
    function inv(uint256 x) internal pure returns (uint256 result) {
        unchecked {
            // 1e36 is SCALE * SCALE.
            result = 1e36 / x;
        }
    }

    /// @notice Calculates the natural logarithm of x.
    ///
    /// @dev Based on the insight that ln(x) = log2(x) / log2(e).
    ///
    /// Requirements:
    /// - All from "log2".
    ///
    /// Caveats:
    /// - All from "log2".
    /// - This doesn't return exactly 1 for 2.718281828459045235, for that we would need more fine-grained precision.
    ///
    /// @param x The unsigned 60.18-decimal fixed-point number for which to calculate the natural logarithm.
    /// @return result The natural logarithm as an unsigned 60.18-decimal fixed-point number.
    function ln(uint256 x) internal pure returns (uint256 result) {
        // Do the fixed-point multiplication inline to save gas. This is overflow-safe because the maximum value that log2(x)
        // can return is 196205294292027477728.
        unchecked {
            result = (log2(x) * SCALE) / LOG2_E;
        }
    }

    /// @notice Calculates the common logarithm of x.
    ///
    /// @dev First checks if x is an exact power of ten and it stops if yes. If it's not, calculates the common
    /// logarithm based on the insight that log10(x) = log2(x) / log2(10).
    ///
    /// Requirements:
    /// - All from "log2".
    ///
    /// Caveats:
    /// - All from "log2".
    ///
    /// @param x The unsigned 60.18-decimal fixed-point number for which to calculate the common logarithm.
    /// @return result The common logarithm as an unsigned 60.18-decimal fixed-point number.
    function log10(uint256 x) internal pure returns (uint256 result) {
        if (x < SCALE) {
            revert PRBMathUD60x18__LogInputTooSmall(x);
        }

        // Note that the "mul" in this block is the assembly multiplication operation, not the "mul" function defined
        // in this contract.
        // prettier-ignore
        assembly {
            switch x
            case 1 { result := mul(SCALE, sub(0, 18)) }
            case 10 { result := mul(SCALE, sub(1, 18)) }
            case 100 { result := mul(SCALE, sub(2, 18)) }
            case 1000 { result := mul(SCALE, sub(3, 18)) }
            case 10000 { result := mul(SCALE, sub(4, 18)) }
            case 100000 { result := mul(SCALE, sub(5, 18)) }
            case 1000000 { result := mul(SCALE, sub(6, 18)) }
            case 10000000 { result := mul(SCALE, sub(7, 18)) }
            case 100000000 { result := mul(SCALE, sub(8, 18)) }
            case 1000000000 { result := mul(SCALE, sub(9, 18)) }
            case 10000000000 { result := mul(SCALE, sub(10, 18)) }
            case 100000000000 { result := mul(SCALE, sub(11, 18)) }
            case 1000000000000 { result := mul(SCALE, sub(12, 18)) }
            case 10000000000000 { result := mul(SCALE, sub(13, 18)) }
            case 100000000000000 { result := mul(SCALE, sub(14, 18)) }
            case 1000000000000000 { result := mul(SCALE, sub(15, 18)) }
            case 10000000000000000 { result := mul(SCALE, sub(16, 18)) }
            case 100000000000000000 { result := mul(SCALE, sub(17, 18)) }
            case 1000000000000000000 { result := 0 }
            case 10000000000000000000 { result := SCALE }
            case 100000000000000000000 { result := mul(SCALE, 2) }
            case 1000000000000000000000 { result := mul(SCALE, 3) }
            case 10000000000000000000000 { result := mul(SCALE, 4) }
            case 100000000000000000000000 { result := mul(SCALE, 5) }
            case 1000000000000000000000000 { result := mul(SCALE, 6) }
            case 10000000000000000000000000 { result := mul(SCALE, 7) }
            case 100000000000000000000000000 { result := mul(SCALE, 8) }
            case 1000000000000000000000000000 { result := mul(SCALE, 9) }
            case 10000000000000000000000000000 { result := mul(SCALE, 10) }
            case 100000000000000000000000000000 { result := mul(SCALE, 11) }
            case 1000000000000000000000000000000 { result := mul(SCALE, 12) }
            case 10000000000000000000000000000000 { result := mul(SCALE, 13) }
            case 100000000000000000000000000000000 { result := mul(SCALE, 14) }
            case 1000000000000000000000000000000000 { result := mul(SCALE, 15) }
            case 10000000000000000000000000000000000 { result := mul(SCALE, 16) }
            case 100000000000000000000000000000000000 { result := mul(SCALE, 17) }
            case 1000000000000000000000000000000000000 { result := mul(SCALE, 18) }
            case 10000000000000000000000000000000000000 { result := mul(SCALE, 19) }
            case 100000000000000000000000000000000000000 { result := mul(SCALE, 20) }
            case 1000000000000000000000000000000000000000 { result := mul(SCALE, 21) }
            case 10000000000000000000000000000000000000000 { result := mul(SCALE, 22) }
            case 100000000000000000000000000000000000000000 { result := mul(SCALE, 23) }
            case 1000000000000000000000000000000000000000000 { result := mul(SCALE, 24) }
            case 10000000000000000000000000000000000000000000 { result := mul(SCALE, 25) }
            case 100000000000000000000000000000000000000000000 { result := mul(SCALE, 26) }
            case 1000000000000000000000000000000000000000000000 { result := mul(SCALE, 27) }
            case 10000000000000000000000000000000000000000000000 { result := mul(SCALE, 28) }
            case 100000000000000000000000000000000000000000000000 { result := mul(SCALE, 29) }
            case 1000000000000000000000000000000000000000000000000 { result := mul(SCALE, 30) }
            case 10000000000000000000000000000000000000000000000000 { result := mul(SCALE, 31) }
            case 100000000000000000000000000000000000000000000000000 { result := mul(SCALE, 32) }
            case 1000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 33) }
            case 10000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 34) }
            case 100000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 35) }
            case 1000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 36) }
            case 10000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 37) }
            case 100000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 38) }
            case 1000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 39) }
            case 10000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 40) }
            case 100000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 41) }
            case 1000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 42) }
            case 10000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 43) }
            case 100000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 44) }
            case 1000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 45) }
            case 10000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 46) }
            case 100000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 47) }
            case 1000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 48) }
            case 10000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 49) }
            case 100000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 50) }
            case 1000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 51) }
            case 10000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 52) }
            case 100000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 53) }
            case 1000000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 54) }
            case 10000000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 55) }
            case 100000000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 56) }
            case 1000000000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 57) }
            case 10000000000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 58) }
            case 100000000000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 59) }
            default {
                result := MAX_UD60x18
            }
        }

        if (result == MAX_UD60x18) {
            // Do the fixed-point division inline to save gas. The denominator is log2(10).
            unchecked {
                result = (log2(x) * SCALE) / 3_321928094887362347;
            }
        }
    }

    /// @notice Calculates the binary logarithm of x.
    ///
    /// @dev Based on the iterative approximation algorithm.
    /// https://en.wikipedia.org/wiki/Binary_logarithm#Iterative_approximation
    ///
    /// Requirements:
    /// - x must be greater than or equal to SCALE, otherwise the result would be negative.
    ///
    /// Caveats:
    /// - The results are nor perfectly accurate to the last decimal, due to the lossy precision of the iterative approximation.
    ///
    /// @param x The unsigned 60.18-decimal fixed-point number for which to calculate the binary logarithm.
    /// @return result The binary logarithm as an unsigned 60.18-decimal fixed-point number.
    function log2(uint256 x) internal pure returns (uint256 result) {
        if (x < SCALE) {
            revert PRBMathUD60x18__LogInputTooSmall(x);
        }
        unchecked {
            // Calculate the integer part of the logarithm and add it to the result and finally calculate y = x * 2^(-n).
            uint256 n = PRBMath.mostSignificantBit(x / SCALE);

            // The integer part of the logarithm as an unsigned 60.18-decimal fixed-point number. The operation can't overflow
            // because n is maximum 255 and SCALE is 1e18.
            result = n * SCALE;

            // This is y = x * 2^(-n).
            uint256 y = x >> n;

            // If y = 1, the fractional part is zero.
            if (y == SCALE) {
                return result;
            }

            // Calculate the fractional part via the iterative approximation.
            // The "delta >>= 1" part is equivalent to "delta /= 2", but shifting bits is faster.
            for (uint256 delta = HALF_SCALE; delta > 0; delta >>= 1) {
                y = (y * y) / SCALE;

                // Is y^2 > 2 and so in the range [2,4)?
                if (y >= 2 * SCALE) {
                    // Add the 2^(-m) factor to the logarithm.
                    result += delta;

                    // Corresponds to z/2 on Wikipedia.
                    y >>= 1;
                }
            }
        }
    }

    /// @notice Multiplies two unsigned 60.18-decimal fixed-point numbers together, returning a new unsigned 60.18-decimal
    /// fixed-point number.
    /// @dev See the documentation for the "PRBMath.mulDivFixedPoint" function.
    /// @param x The multiplicand as an unsigned 60.18-decimal fixed-point number.
    /// @param y The multiplier as an unsigned 60.18-decimal fixed-point number.
    /// @return result The product as an unsigned 60.18-decimal fixed-point number.
    function mul(uint256 x, uint256 y) internal pure returns (uint256 result) {
        result = PRBMath.mulDivFixedPoint(x, y);
    }

    /// @notice Returns PI as an unsigned 60.18-decimal fixed-point number.
    function pi() internal pure returns (uint256 result) {
        result = 3_141592653589793238;
    }

    /// @notice Raises x to the power of y.
    ///
    /// @dev Based on the insight that x^y = 2^(log2(x) * y).
    ///
    /// Requirements:
    /// - All from "exp2", "log2" and "mul".
    ///
    /// Caveats:
    /// - All from "exp2", "log2" and "mul".
    /// - Assumes 0^0 is 1.
    ///
    /// @param x Number to raise to given power y, as an unsigned 60.18-decimal fixed-point number.
    /// @param y Exponent to raise x to, as an unsigned 60.18-decimal fixed-point number.
    /// @return result x raised to power y, as an unsigned 60.18-decimal fixed-point number.
    function pow(uint256 x, uint256 y) internal pure returns (uint256 result) {
        if (x == 0) {
            result = y == 0 ? SCALE : uint256(0);
        } else {
            result = exp2(mul(log2(x), y));
        }
    }

    /// @notice Raises x (unsigned 60.18-decimal fixed-point number) to the power of y (basic unsigned integer) using the
    /// famous algorithm "exponentiation by squaring".
    ///
    /// @dev See https://en.wikipedia.org/wiki/Exponentiation_by_squaring
    ///
    /// Requirements:
    /// - The result must fit within MAX_UD60x18.
    ///
    /// Caveats:
    /// - All from "mul".
    /// - Assumes 0^0 is 1.
    ///
    /// @param x The base as an unsigned 60.18-decimal fixed-point number.
    /// @param y The exponent as an uint256.
    /// @return result The result as an unsigned 60.18-decimal fixed-point number.
    function powu(uint256 x, uint256 y) internal pure returns (uint256 result) {
        // Calculate the first iteration of the loop in advance.
        result = y & 1 > 0 ? x : SCALE;

        // Equivalent to "for(y /= 2; y > 0; y /= 2)" but faster.
        for (y >>= 1; y > 0; y >>= 1) {
            x = PRBMath.mulDivFixedPoint(x, x);

            // Equivalent to "y % 2 == 1" but faster.
            if (y & 1 > 0) {
                result = PRBMath.mulDivFixedPoint(result, x);
            }
        }
    }

    /// @notice Returns 1 as an unsigned 60.18-decimal fixed-point number.
    function scale() internal pure returns (uint256 result) {
        result = SCALE;
    }

    /// @notice Calculates the square root of x, rounding down.
    /// @dev Uses the Babylonian method https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method.
    ///
    /// Requirements:
    /// - x must be less than MAX_UD60x18 / SCALE.
    ///
    /// @param x The unsigned 60.18-decimal fixed-point number for which to calculate the square root.
    /// @return result The result as an unsigned 60.18-decimal fixed-point .
    function sqrt(uint256 x) internal pure returns (uint256 result) {
        unchecked {
            if (x > MAX_UD60x18 / SCALE) {
                revert PRBMathUD60x18__SqrtOverflow(x);
            }
            // Multiply x by the SCALE to account for the factor of SCALE that is picked up when multiplying two unsigned
            // 60.18-decimal fixed-point numbers together (in this case, those two numbers are both the square root).
            result = PRBMath.sqrt(x * SCALE);
        }
    }

    /// @notice Converts a unsigned 60.18-decimal fixed-point number to basic integer form, rounding down in the process.
    /// @param x The unsigned 60.18-decimal fixed-point number to convert.
    /// @return result The same number in basic integer form.
    function toUint(uint256 x) internal pure returns (uint256 result) {
        unchecked {
            result = x / SCALE;
        }
    }
}

// SPDX-License-Identifier: Unlicense
pragma solidity >=0.8.4;

import "./PRBMath.sol";

/// @title PRBMathSD59x18
/// @author Paul Razvan Berg
/// @notice Smart contract library for advanced fixed-point math that works with int256 numbers considered to have 18
/// trailing decimals. We call this number representation signed 59.18-decimal fixed-point, since the numbers can have
/// a sign and there can be up to 59 digits in the integer part and up to 18 decimals in the fractional part. The numbers
/// are bound by the minimum and the maximum values permitted by the Solidity type int256.
library PRBMathSD59x18 {
    /// @dev log2(e) as a signed 59.18-decimal fixed-point number.
    int256 internal constant LOG2_E = 1_442695040888963407;

    /// @dev Half the SCALE number.
    int256 internal constant HALF_SCALE = 5e17;

    /// @dev The maximum value a signed 59.18-decimal fixed-point number can have.
    int256 internal constant MAX_SD59x18 =
        57896044618658097711785492504343953926634992332820282019728_792003956564819967;

    /// @dev The maximum whole value a signed 59.18-decimal fixed-point number can have.
    int256 internal constant MAX_WHOLE_SD59x18 =
        57896044618658097711785492504343953926634992332820282019728_000000000000000000;

    /// @dev The minimum value a signed 59.18-decimal fixed-point number can have.
    int256 internal constant MIN_SD59x18 =
        -57896044618658097711785492504343953926634992332820282019728_792003956564819968;

    /// @dev The minimum whole value a signed 59.18-decimal fixed-point number can have.
    int256 internal constant MIN_WHOLE_SD59x18 =
        -57896044618658097711785492504343953926634992332820282019728_000000000000000000;

    /// @dev How many trailing decimals can be represented.
    int256 internal constant SCALE = 1e18;

    /// INTERNAL FUNCTIONS ///

    /// @notice Calculate the absolute value of x.
    ///
    /// @dev Requirements:
    /// - x must be greater than MIN_SD59x18.
    ///
    /// @param x The number to calculate the absolute value for.
    /// @param result The absolute value of x.
    function abs(int256 x) internal pure returns (int256 result) {
        unchecked {
            if (x == MIN_SD59x18) {
                revert PRBMathSD59x18__AbsInputTooSmall();
            }
            result = x < 0 ? -x : x;
        }
    }

    /// @notice Calculates the arithmetic average of x and y, rounding down.
    /// @param x The first operand as a signed 59.18-decimal fixed-point number.
    /// @param y The second operand as a signed 59.18-decimal fixed-point number.
    /// @return result The arithmetic average as a signed 59.18-decimal fixed-point number.
    function avg(int256 x, int256 y) internal pure returns (int256 result) {
        // The operations can never overflow.
        unchecked {
            int256 sum = (x >> 1) + (y >> 1);
            if (sum < 0) {
                // If at least one of x and y is odd, we add 1 to the result. This is because shifting negative numbers to the
                // right rounds down to infinity.
                assembly {
                    result := add(sum, and(or(x, y), 1))
                }
            } else {
                // If both x and y are odd, we add 1 to the result. This is because if both numbers are odd, the 0.5
                // remainder gets truncated twice.
                result = sum + (x & y & 1);
            }
        }
    }

    /// @notice Yields the least greatest signed 59.18 decimal fixed-point number greater than or equal to x.
    ///
    /// @dev Optimized for fractional value inputs, because for every whole value there are (1e18 - 1) fractional counterparts.
    /// See https://en.wikipedia.org/wiki/Floor_and_ceiling_functions.
    ///
    /// Requirements:
    /// - x must be less than or equal to MAX_WHOLE_SD59x18.
    ///
    /// @param x The signed 59.18-decimal fixed-point number to ceil.
    /// @param result The least integer greater than or equal to x, as a signed 58.18-decimal fixed-point number.
    function ceil(int256 x) internal pure returns (int256 result) {
        if (x > MAX_WHOLE_SD59x18) {
            revert PRBMathSD59x18__CeilOverflow(x);
        }
        unchecked {
            int256 remainder = x % SCALE;
            if (remainder == 0) {
                result = x;
            } else {
                // Solidity uses C fmod style, which returns a modulus with the same sign as x.
                result = x - remainder;
                if (x > 0) {
                    result += SCALE;
                }
            }
        }
    }

    /// @notice Divides two signed 59.18-decimal fixed-point numbers, returning a new signed 59.18-decimal fixed-point number.
    ///
    /// @dev Variant of "mulDiv" that works with signed numbers. Works by computing the signs and the absolute values separately.
    ///
    /// Requirements:
    /// - All from "PRBMath.mulDiv".
    /// - None of the inputs can be MIN_SD59x18.
    /// - The denominator cannot be zero.
    /// - The result must fit within int256.
    ///
    /// Caveats:
    /// - All from "PRBMath.mulDiv".
    ///
    /// @param x The numerator as a signed 59.18-decimal fixed-point number.
    /// @param y The denominator as a signed 59.18-decimal fixed-point number.
    /// @param result The quotient as a signed 59.18-decimal fixed-point number.
    function div(int256 x, int256 y) internal pure returns (int256 result) {
        if (x == MIN_SD59x18 || y == MIN_SD59x18) {
            revert PRBMathSD59x18__DivInputTooSmall();
        }

        // Get hold of the absolute values of x and y.
        uint256 ax;
        uint256 ay;
        unchecked {
            ax = x < 0 ? uint256(-x) : uint256(x);
            ay = y < 0 ? uint256(-y) : uint256(y);
        }

        // Compute the absolute value of (x*SCALE)÷y. The result must fit within int256.
        uint256 rAbs = PRBMath.mulDiv(ax, uint256(SCALE), ay);
        if (rAbs > uint256(MAX_SD59x18)) {
            revert PRBMathSD59x18__DivOverflow(rAbs);
        }

        // Get the signs of x and y.
        uint256 sx;
        uint256 sy;
        assembly {
            sx := sgt(x, sub(0, 1))
            sy := sgt(y, sub(0, 1))
        }

        // XOR over sx and sy. This is basically checking whether the inputs have the same sign. If yes, the result
        // should be positive. Otherwise, it should be negative.
        result = sx ^ sy == 1 ? -int256(rAbs) : int256(rAbs);
    }

    /// @notice Returns Euler's number as a signed 59.18-decimal fixed-point number.
    /// @dev See https://en.wikipedia.org/wiki/E_(mathematical_constant).
    function e() internal pure returns (int256 result) {
        result = 2_718281828459045235;
    }

    /// @notice Calculates the natural exponent of x.
    ///
    /// @dev Based on the insight that e^x = 2^(x * log2(e)).
    ///
    /// Requirements:
    /// - All from "log2".
    /// - x must be less than 133.084258667509499441.
    ///
    /// Caveats:
    /// - All from "exp2".
    /// - For any x less than -41.446531673892822322, the result is zero.
    ///
    /// @param x The exponent as a signed 59.18-decimal fixed-point number.
    /// @return result The result as a signed 59.18-decimal fixed-point number.
    function exp(int256 x) internal pure returns (int256 result) {
        // Without this check, the value passed to "exp2" would be less than -59.794705707972522261.
        if (x < -41_446531673892822322) {
            return 0;
        }

        // Without this check, the value passed to "exp2" would be greater than 192.
        if (x >= 133_084258667509499441) {
            revert PRBMathSD59x18__ExpInputTooBig(x);
        }

        // Do the fixed-point multiplication inline to save gas.
        unchecked {
            int256 doubleScaleProduct = x * LOG2_E;
            result = exp2((doubleScaleProduct + HALF_SCALE) / SCALE);
        }
    }

    /// @notice Calculates the binary exponent of x using the binary fraction method.
    ///
    /// @dev See https://ethereum.stackexchange.com/q/79903/24693.
    ///
    /// Requirements:
    /// - x must be 192 or less.
    /// - The result must fit within MAX_SD59x18.
    ///
    /// Caveats:
    /// - For any x less than -59.794705707972522261, the result is zero.
    ///
    /// @param x The exponent as a signed 59.18-decimal fixed-point number.
    /// @return result The result as a signed 59.18-decimal fixed-point number.
    function exp2(int256 x) internal pure returns (int256 result) {
        // This works because 2^(-x) = 1/2^x.
        if (x < 0) {
            // 2^59.794705707972522262 is the maximum number whose inverse does not truncate down to zero.
            if (x < -59_794705707972522261) {
                return 0;
            }

            // Do the fixed-point inversion inline to save gas. The numerator is SCALE * SCALE.
            unchecked {
                result = 1e36 / exp2(-x);
            }
        } else {
            // 2^192 doesn't fit within the 192.64-bit format used internally in this function.
            if (x >= 192e18) {
                revert PRBMathSD59x18__Exp2InputTooBig(x);
            }

            unchecked {
                // Convert x to the 192.64-bit fixed-point format.
                uint256 x192x64 = (uint256(x) << 64) / uint256(SCALE);

                // Safe to convert the result to int256 directly because the maximum input allowed is 192.
                result = int256(PRBMath.exp2(x192x64));
            }
        }
    }

    /// @notice Yields the greatest signed 59.18 decimal fixed-point number less than or equal to x.
    ///
    /// @dev Optimized for fractional value inputs, because for every whole value there are (1e18 - 1) fractional counterparts.
    /// See https://en.wikipedia.org/wiki/Floor_and_ceiling_functions.
    ///
    /// Requirements:
    /// - x must be greater than or equal to MIN_WHOLE_SD59x18.
    ///
    /// @param x The signed 59.18-decimal fixed-point number to floor.
    /// @param result The greatest integer less than or equal to x, as a signed 58.18-decimal fixed-point number.
    function floor(int256 x) internal pure returns (int256 result) {
        if (x < MIN_WHOLE_SD59x18) {
            revert PRBMathSD59x18__FloorUnderflow(x);
        }
        unchecked {
            int256 remainder = x % SCALE;
            if (remainder == 0) {
                result = x;
            } else {
                // Solidity uses C fmod style, which returns a modulus with the same sign as x.
                result = x - remainder;
                if (x < 0) {
                    result -= SCALE;
                }
            }
        }
    }

    /// @notice Yields the excess beyond the floor of x for positive numbers and the part of the number to the right
    /// of the radix point for negative numbers.
    /// @dev Based on the odd function definition. https://en.wikipedia.org/wiki/Fractional_part
    /// @param x The signed 59.18-decimal fixed-point number to get the fractional part of.
    /// @param result The fractional part of x as a signed 59.18-decimal fixed-point number.
    function frac(int256 x) internal pure returns (int256 result) {
        unchecked {
            result = x % SCALE;
        }
    }

    /// @notice Converts a number from basic integer form to signed 59.18-decimal fixed-point representation.
    ///
    /// @dev Requirements:
    /// - x must be greater than or equal to MIN_SD59x18 divided by SCALE.
    /// - x must be less than or equal to MAX_SD59x18 divided by SCALE.
    ///
    /// @param x The basic integer to convert.
    /// @param result The same number in signed 59.18-decimal fixed-point representation.
    function fromInt(int256 x) internal pure returns (int256 result) {
        unchecked {
            if (x < MIN_SD59x18 / SCALE) {
                revert PRBMathSD59x18__FromIntUnderflow(x);
            }
            if (x > MAX_SD59x18 / SCALE) {
                revert PRBMathSD59x18__FromIntOverflow(x);
            }
            result = x * SCALE;
        }
    }

    /// @notice Calculates geometric mean of x and y, i.e. sqrt(x * y), rounding down.
    ///
    /// @dev Requirements:
    /// - x * y must fit within MAX_SD59x18, lest it overflows.
    /// - x * y cannot be negative.
    ///
    /// @param x The first operand as a signed 59.18-decimal fixed-point number.
    /// @param y The second operand as a signed 59.18-decimal fixed-point number.
    /// @return result The result as a signed 59.18-decimal fixed-point number.
    function gm(int256 x, int256 y) internal pure returns (int256 result) {
        if (x == 0) {
            return 0;
        }

        unchecked {
            // Checking for overflow this way is faster than letting Solidity do it.
            int256 xy = x * y;
            if (xy / x != y) {
                revert PRBMathSD59x18__GmOverflow(x, y);
            }

            // The product cannot be negative.
            if (xy < 0) {
                revert PRBMathSD59x18__GmNegativeProduct(x, y);
            }

            // We don't need to multiply by the SCALE here because the x*y product had already picked up a factor of SCALE
            // during multiplication. See the comments within the "sqrt" function.
            result = int256(PRBMath.sqrt(uint256(xy)));
        }
    }

    /// @notice Calculates 1 / x, rounding toward zero.
    ///
    /// @dev Requirements:
    /// - x cannot be zero.
    ///
    /// @param x The signed 59.18-decimal fixed-point number for which to calculate the inverse.
    /// @return result The inverse as a signed 59.18-decimal fixed-point number.
    function inv(int256 x) internal pure returns (int256 result) {
        unchecked {
            // 1e36 is SCALE * SCALE.
            result = 1e36 / x;
        }
    }

    /// @notice Calculates the natural logarithm of x.
    ///
    /// @dev Based on the insight that ln(x) = log2(x) / log2(e).
    ///
    /// Requirements:
    /// - All from "log2".
    ///
    /// Caveats:
    /// - All from "log2".
    /// - This doesn't return exactly 1 for 2718281828459045235, for that we would need more fine-grained precision.
    ///
    /// @param x The signed 59.18-decimal fixed-point number for which to calculate the natural logarithm.
    /// @return result The natural logarithm as a signed 59.18-decimal fixed-point number.
    function ln(int256 x) internal pure returns (int256 result) {
        // Do the fixed-point multiplication inline to save gas. This is overflow-safe because the maximum value that log2(x)
        // can return is 195205294292027477728.
        unchecked {
            result = (log2(x) * SCALE) / LOG2_E;
        }
    }

    /// @notice Calculates the common logarithm of x.
    ///
    /// @dev First checks if x is an exact power of ten and it stops if yes. If it's not, calculates the common
    /// logarithm based on the insight that log10(x) = log2(x) / log2(10).
    ///
    /// Requirements:
    /// - All from "log2".
    ///
    /// Caveats:
    /// - All from "log2".
    ///
    /// @param x The signed 59.18-decimal fixed-point number for which to calculate the common logarithm.
    /// @return result The common logarithm as a signed 59.18-decimal fixed-point number.
    function log10(int256 x) internal pure returns (int256 result) {
        if (x <= 0) {
            revert PRBMathSD59x18__LogInputTooSmall(x);
        }

        // Note that the "mul" in this block is the assembly mul operation, not the "mul" function defined in this contract.
        // prettier-ignore
        assembly {
            switch x
            case 1 { result := mul(SCALE, sub(0, 18)) }
            case 10 { result := mul(SCALE, sub(1, 18)) }
            case 100 { result := mul(SCALE, sub(2, 18)) }
            case 1000 { result := mul(SCALE, sub(3, 18)) }
            case 10000 { result := mul(SCALE, sub(4, 18)) }
            case 100000 { result := mul(SCALE, sub(5, 18)) }
            case 1000000 { result := mul(SCALE, sub(6, 18)) }
            case 10000000 { result := mul(SCALE, sub(7, 18)) }
            case 100000000 { result := mul(SCALE, sub(8, 18)) }
            case 1000000000 { result := mul(SCALE, sub(9, 18)) }
            case 10000000000 { result := mul(SCALE, sub(10, 18)) }
            case 100000000000 { result := mul(SCALE, sub(11, 18)) }
            case 1000000000000 { result := mul(SCALE, sub(12, 18)) }
            case 10000000000000 { result := mul(SCALE, sub(13, 18)) }
            case 100000000000000 { result := mul(SCALE, sub(14, 18)) }
            case 1000000000000000 { result := mul(SCALE, sub(15, 18)) }
            case 10000000000000000 { result := mul(SCALE, sub(16, 18)) }
            case 100000000000000000 { result := mul(SCALE, sub(17, 18)) }
            case 1000000000000000000 { result := 0 }
            case 10000000000000000000 { result := SCALE }
            case 100000000000000000000 { result := mul(SCALE, 2) }
            case 1000000000000000000000 { result := mul(SCALE, 3) }
            case 10000000000000000000000 { result := mul(SCALE, 4) }
            case 100000000000000000000000 { result := mul(SCALE, 5) }
            case 1000000000000000000000000 { result := mul(SCALE, 6) }
            case 10000000000000000000000000 { result := mul(SCALE, 7) }
            case 100000000000000000000000000 { result := mul(SCALE, 8) }
            case 1000000000000000000000000000 { result := mul(SCALE, 9) }
            case 10000000000000000000000000000 { result := mul(SCALE, 10) }
            case 100000000000000000000000000000 { result := mul(SCALE, 11) }
            case 1000000000000000000000000000000 { result := mul(SCALE, 12) }
            case 10000000000000000000000000000000 { result := mul(SCALE, 13) }
            case 100000000000000000000000000000000 { result := mul(SCALE, 14) }
            case 1000000000000000000000000000000000 { result := mul(SCALE, 15) }
            case 10000000000000000000000000000000000 { result := mul(SCALE, 16) }
            case 100000000000000000000000000000000000 { result := mul(SCALE, 17) }
            case 1000000000000000000000000000000000000 { result := mul(SCALE, 18) }
            case 10000000000000000000000000000000000000 { result := mul(SCALE, 19) }
            case 100000000000000000000000000000000000000 { result := mul(SCALE, 20) }
            case 1000000000000000000000000000000000000000 { result := mul(SCALE, 21) }
            case 10000000000000000000000000000000000000000 { result := mul(SCALE, 22) }
            case 100000000000000000000000000000000000000000 { result := mul(SCALE, 23) }
            case 1000000000000000000000000000000000000000000 { result := mul(SCALE, 24) }
            case 10000000000000000000000000000000000000000000 { result := mul(SCALE, 25) }
            case 100000000000000000000000000000000000000000000 { result := mul(SCALE, 26) }
            case 1000000000000000000000000000000000000000000000 { result := mul(SCALE, 27) }
            case 10000000000000000000000000000000000000000000000 { result := mul(SCALE, 28) }
            case 100000000000000000000000000000000000000000000000 { result := mul(SCALE, 29) }
            case 1000000000000000000000000000000000000000000000000 { result := mul(SCALE, 30) }
            case 10000000000000000000000000000000000000000000000000 { result := mul(SCALE, 31) }
            case 100000000000000000000000000000000000000000000000000 { result := mul(SCALE, 32) }
            case 1000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 33) }
            case 10000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 34) }
            case 100000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 35) }
            case 1000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 36) }
            case 10000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 37) }
            case 100000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 38) }
            case 1000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 39) }
            case 10000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 40) }
            case 100000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 41) }
            case 1000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 42) }
            case 10000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 43) }
            case 100000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 44) }
            case 1000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 45) }
            case 10000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 46) }
            case 100000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 47) }
            case 1000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 48) }
            case 10000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 49) }
            case 100000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 50) }
            case 1000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 51) }
            case 10000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 52) }
            case 100000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 53) }
            case 1000000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 54) }
            case 10000000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 55) }
            case 100000000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 56) }
            case 1000000000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 57) }
            case 10000000000000000000000000000000000000000000000000000000000000000000000000000 { result := mul(SCALE, 58) }
            default {
                result := MAX_SD59x18
            }
        }

        if (result == MAX_SD59x18) {
            // Do the fixed-point division inline to save gas. The denominator is log2(10).
            unchecked {
                result = (log2(x) * SCALE) / 3_321928094887362347;
            }
        }
    }

    /// @notice Calculates the binary logarithm of x.
    ///
    /// @dev Based on the iterative approximation algorithm.
    /// https://en.wikipedia.org/wiki/Binary_logarithm#Iterative_approximation
    ///
    /// Requirements:
    /// - x must be greater than zero.
    ///
    /// Caveats:
    /// - The results are not perfectly accurate to the last decimal, due to the lossy precision of the iterative approximation.
    ///
    /// @param x The signed 59.18-decimal fixed-point number for which to calculate the binary logarithm.
    /// @return result The binary logarithm as a signed 59.18-decimal fixed-point number.
    function log2(int256 x) internal pure returns (int256 result) {
        if (x <= 0) {
            revert PRBMathSD59x18__LogInputTooSmall(x);
        }
        unchecked {
            // This works because log2(x) = -log2(1/x).
            int256 sign;
            if (x >= SCALE) {
                sign = 1;
            } else {
                sign = -1;
                // Do the fixed-point inversion inline to save gas. The numerator is SCALE * SCALE.
                assembly {
                    x := div(1000000000000000000000000000000000000, x)
                }
            }

            // Calculate the integer part of the logarithm and add it to the result and finally calculate y = x * 2^(-n).
            uint256 n = PRBMath.mostSignificantBit(uint256(x / SCALE));

            // The integer part of the logarithm as a signed 59.18-decimal fixed-point number. The operation can't overflow
            // because n is maximum 255, SCALE is 1e18 and sign is either 1 or -1.
            result = int256(n) * SCALE;

            // This is y = x * 2^(-n).
            int256 y = x >> n;

            // If y = 1, the fractional part is zero.
            if (y == SCALE) {
                return result * sign;
            }

            // Calculate the fractional part via the iterative approximation.
            // The "delta >>= 1" part is equivalent to "delta /= 2", but shifting bits is faster.
            for (int256 delta = int256(HALF_SCALE); delta > 0; delta >>= 1) {
                y = (y * y) / SCALE;

                // Is y^2 > 2 and so in the range [2,4)?
                if (y >= 2 * SCALE) {
                    // Add the 2^(-m) factor to the logarithm.
                    result += delta;

                    // Corresponds to z/2 on Wikipedia.
                    y >>= 1;
                }
            }
            result *= sign;
        }
    }

    /// @notice Multiplies two signed 59.18-decimal fixed-point numbers together, returning a new signed 59.18-decimal
    /// fixed-point number.
    ///
    /// @dev Variant of "mulDiv" that works with signed numbers and employs constant folding, i.e. the denominator is
    /// always 1e18.
    ///
    /// Requirements:
    /// - All from "PRBMath.mulDivFixedPoint".
    /// - None of the inputs can be MIN_SD59x18
    /// - The result must fit within MAX_SD59x18.
    ///
    /// Caveats:
    /// - The body is purposely left uncommented; see the NatSpec comments in "PRBMath.mulDiv" to understand how this works.
    ///
    /// @param x The multiplicand as a signed 59.18-decimal fixed-point number.
    /// @param y The multiplier as a signed 59.18-decimal fixed-point number.
    /// @return result The product as a signed 59.18-decimal fixed-point number.
    function mul(int256 x, int256 y) internal pure returns (int256 result) {
        if (x == MIN_SD59x18 || y == MIN_SD59x18) {
            revert PRBMathSD59x18__MulInputTooSmall();
        }

        unchecked {
            uint256 ax;
            uint256 ay;
            ax = x < 0 ? uint256(-x) : uint256(x);
            ay = y < 0 ? uint256(-y) : uint256(y);

            uint256 rAbs = PRBMath.mulDivFixedPoint(ax, ay);
            if (rAbs > uint256(MAX_SD59x18)) {
                revert PRBMathSD59x18__MulOverflow(rAbs);
            }

            uint256 sx;
            uint256 sy;
            assembly {
                sx := sgt(x, sub(0, 1))
                sy := sgt(y, sub(0, 1))
            }
            result = sx ^ sy == 1 ? -int256(rAbs) : int256(rAbs);
        }
    }

    /// @notice Returns PI as a signed 59.18-decimal fixed-point number.
    function pi() internal pure returns (int256 result) {
        result = 3_141592653589793238;
    }

    /// @notice Raises x to the power of y.
    ///
    /// @dev Based on the insight that x^y = 2^(log2(x) * y).
    ///
    /// Requirements:
    /// - All from "exp2", "log2" and "mul".
    /// - z cannot be zero.
    ///
    /// Caveats:
    /// - All from "exp2", "log2" and "mul".
    /// - Assumes 0^0 is 1.
    ///
    /// @param x Number to raise to given power y, as a signed 59.18-decimal fixed-point number.
    /// @param y Exponent to raise x to, as a signed 59.18-decimal fixed-point number.
    /// @return result x raised to power y, as a signed 59.18-decimal fixed-point number.
    function pow(int256 x, int256 y) internal pure returns (int256 result) {
        if (x == 0) {
            result = y == 0 ? SCALE : int256(0);
        } else {
            result = exp2(mul(log2(x), y));
        }
    }

    /// @notice Raises x (signed 59.18-decimal fixed-point number) to the power of y (basic unsigned integer) using the
    /// famous algorithm "exponentiation by squaring".
    ///
    /// @dev See https://en.wikipedia.org/wiki/Exponentiation_by_squaring
    ///
    /// Requirements:
    /// - All from "abs" and "PRBMath.mulDivFixedPoint".
    /// - The result must fit within MAX_SD59x18.
    ///
    /// Caveats:
    /// - All from "PRBMath.mulDivFixedPoint".
    /// - Assumes 0^0 is 1.
    ///
    /// @param x The base as a signed 59.18-decimal fixed-point number.
    /// @param y The exponent as an uint256.
    /// @return result The result as a signed 59.18-decimal fixed-point number.
    function powu(int256 x, uint256 y) internal pure returns (int256 result) {
        uint256 xAbs = uint256(abs(x));

        // Calculate the first iteration of the loop in advance.
        uint256 rAbs = y & 1 > 0 ? xAbs : uint256(SCALE);

        // Equivalent to "for(y /= 2; y > 0; y /= 2)" but faster.
        uint256 yAux = y;
        for (yAux >>= 1; yAux > 0; yAux >>= 1) {
            xAbs = PRBMath.mulDivFixedPoint(xAbs, xAbs);

            // Equivalent to "y % 2 == 1" but faster.
            if (yAux & 1 > 0) {
                rAbs = PRBMath.mulDivFixedPoint(rAbs, xAbs);
            }
        }

        // The result must fit within the 59.18-decimal fixed-point representation.
        if (rAbs > uint256(MAX_SD59x18)) {
            revert PRBMathSD59x18__PowuOverflow(rAbs);
        }

        // Is the base negative and the exponent an odd number?
        bool isNegative = x < 0 && y & 1 == 1;
        result = isNegative ? -int256(rAbs) : int256(rAbs);
    }

    /// @notice Returns 1 as a signed 59.18-decimal fixed-point number.
    function scale() internal pure returns (int256 result) {
        result = SCALE;
    }

    /// @notice Calculates the square root of x, rounding down.
    /// @dev Uses the Babylonian method https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method.
    ///
    /// Requirements:
    /// - x cannot be negative.
    /// - x must be less than MAX_SD59x18 / SCALE.
    ///
    /// @param x The signed 59.18-decimal fixed-point number for which to calculate the square root.
    /// @return result The result as a signed 59.18-decimal fixed-point .
    function sqrt(int256 x) internal pure returns (int256 result) {
        unchecked {
            if (x < 0) {
                revert PRBMathSD59x18__SqrtNegativeInput(x);
            }
            if (x > MAX_SD59x18 / SCALE) {
                revert PRBMathSD59x18__SqrtOverflow(x);
            }
            // Multiply x by the SCALE to account for the factor of SCALE that is picked up when multiplying two signed
            // 59.18-decimal fixed-point numbers together (in this case, those two numbers are both the square root).
            result = int256(PRBMath.sqrt(uint256(x * SCALE)));
        }
    }

    /// @notice Converts a signed 59.18-decimal fixed-point number to basic integer form, rounding down in the process.
    /// @param x The signed 59.18-decimal fixed-point number to convert.
    /// @return result The same number in basic integer form.
    function toInt(int256 x) internal pure returns (int256 result) {
        unchecked {
            result = x / SCALE;
        }
    }
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

import "./YSSModule.sol";
import "../BalanceSheetModule.sol";

/// @notice Abstract contract for contracts that are part of the Yama Finance protocol.
abstract contract YSSModuleExtended is YSSModule {
  BalanceSheetModule public balanceSheet;

  /// @notice Sets the stablecoin and balance sheet
  /// @param _stablecoin Stablecoin to set
  /// @param _balanceSheet Balance sheet to set
  constructor(
    YSS _stablecoin, BalanceSheetModule _balanceSheet
  ) YSSModule(_stablecoin) {
    balanceSheet = _balanceSheet;
  }

  /// @notice Sets the balance sheet
  function setBalanceSheet(
    BalanceSheetModule _balanceSheet
  ) external onlyAllowlist {
    balanceSheet = _balanceSheet;
  }

}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

/// @notice Returns the price of a collateral type in Yama.
/// @dev Used by the CDP module to determine the value of collateral.
interface IPriceSource {
  /// @notice Returns the price of a collateral type in Yama.
  /// @return amount price of the collateral type in Yama.
  function price() external view returns (uint256 amount);
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

/// @notice Performs actions with CDP collateral, such as re-lending.
interface ICollateralManager {
  /// @notice Called when collateral is deposited into a CDP.
  /// @param vaultId The CDP ID.
  /// @param amount The amount of collateral deposited.
  function handleCollateralDeposit(
    uint256 vaultId,
    uint256 amount
  ) external;

  /// @notice Called when collateral is withdrawn from a CDP.
  /// @param vaultId The CDP ID.
  /// @param amount The amount of collateral withdrawn.
  function handleCollateralWithdrawal(
    uint256 vaultId,
    uint256 amount
  ) external;
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

/// @notice A contract the CDP calls to liquidate undercollateralized vaults.
interface ILiquidator {
  /// @notice Liquidates a CDP.
  /// @param vaultId The CDP vault ID.
  /// @return successful True if the liquidator accepts this liquidation.
  function liquidate(uint256 vaultId) external returns (bool successful);
}

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

pragma solidity ^0.8.0;

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.0;

import "../utils/Context.sol";

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

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

    /**
     * @dev Initializes the contract setting the deployer as the initial owner.
     */
    constructor() {
        _transferOwnership(_msgSender());
    }

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

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

    /**
     * @dev Throws if the sender is not the owner.
     */
    function _checkOwner() internal view virtual {
        require(owner() == _msgSender(), "Ownable: caller is not the owner");
    }

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

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        require(newOwner != address(0), "Ownable: new owner is the zero address");
        _transferOwnership(newOwner);
    }

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

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

pragma solidity ^0.8.0;

import "../IERC20.sol";
import "../extensions/IERC20Permit.sol";
import "../../../utils/Address.sol";

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

    function safeTransfer(
        IERC20 token,
        address to,
        uint256 value
    ) internal {
        _callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value));
    }

    function safeTransferFrom(
        IERC20 token,
        address from,
        address to,
        uint256 value
    ) internal {
        _callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value));
    }

    /**
     * @dev Deprecated. This function has issues similar to the ones found in
     * {IERC20-approve}, and its usage is discouraged.
     *
     * Whenever possible, use {safeIncreaseAllowance} and
     * {safeDecreaseAllowance} instead.
     */
    function safeApprove(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        // safeApprove should only be called when setting an initial allowance,
        // or when resetting it to zero. To increase and decrease it, use
        // 'safeIncreaseAllowance' and 'safeDecreaseAllowance'
        require(
            (value == 0) || (token.allowance(address(this), spender) == 0),
            "SafeERC20: approve from non-zero to non-zero allowance"
        );
        _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value));
    }

    function safeIncreaseAllowance(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        uint256 newAllowance = token.allowance(address(this), spender) + value;
        _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
    }

    function safeDecreaseAllowance(
        IERC20 token,
        address spender,
        uint256 value
    ) internal {
        unchecked {
            uint256 oldAllowance = token.allowance(address(this), spender);
            require(oldAllowance >= value, "SafeERC20: decreased allowance below zero");
            uint256 newAllowance = oldAllowance - value;
            _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));
        }
    }

    function safePermit(
        IERC20Permit token,
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) internal {
        uint256 nonceBefore = token.nonces(owner);
        token.permit(owner, spender, value, deadline, v, r, s);
        uint256 nonceAfter = token.nonces(owner);
        require(nonceAfter == nonceBefore + 1, "SafeERC20: permit did not succeed");
    }

    /**
     * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
     * on the return value: the return value is optional (but if data is returned, it must not be false).
     * @param token The token targeted by the call.
     * @param data The call data (encoded using abi.encode or one of its variants).
     */
    function _callOptionalReturn(IERC20 token, bytes memory data) private {
        // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
        // we're implementing it ourselves. We use {Address-functionCall} to perform this call, which verifies that
        // the target address contains contract code and also asserts for success in the low-level call.

        bytes memory returndata = address(token).functionCall(data, "SafeERC20: low-level call failed");
        if (returndata.length > 0) {
            // Return data is optional
            require(abi.decode(returndata, (bool)), "SafeERC20: ERC20 operation did not succeed");
        }
    }
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

import "../../YSS.sol";
import "./Module.sol";

/// @notice Abstract contract to easily check if caller is on the YSS's allowlist
abstract contract YSSModule is Module {
  YSS public stablecoin;
  
  /// @notice Modifier to check if caller is on the allowlist
  modifier onlyAllowlist() {
    require(stablecoin.allowlist(msg.sender));
    _;
  }

  /// @notice Sets the token
  /// @param _stablecoin Token to set
  constructor(YSS _stablecoin) {
    stablecoin = _stablecoin;
  }
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

import "src/modules/templates/YSSModuleExtended.sol";
import "src/interfaces/IBalanceSheetHandler.sol";

/// @notice Whenever there is surplus, SimpleBSH gives part of it to the target address
contract SimpleBSH is YSSModuleExtended, IBalanceSheetHandler {
  /// @notice The address receiving part of the surplus
  address public immutable target;
  
  uint256 public revenueShare;
  uint256 public constant DENOMINATOR = 10000;
  uint256 public lastBlockUpdate;
  uint256 public pendingShareAmount;

  /// @notice Sets the stablecoin, balance sheet, revenue share and target
  /// @param _stablecoin Stablecoin to set
  /// @param _balanceSheet Balance sheet to set
  /// @param _revenueShare Revenue share to set
  /// @param _target Target to set
  constructor(
    YSS _stablecoin,
    BalanceSheetModule _balanceSheet,
    uint256 _revenueShare,
    address _target
  )
    YSSModuleExtended(_stablecoin, _balanceSheet)
  {
    revenueShare = _revenueShare;
    target = _target;
  }

  /// @notice Sets the revenue share
  /// @param _revenueShare Revenue share to set
  function setRevenueShare(uint256 _revenueShare) external onlyAllowlist {
    require(_revenueShare <= DENOMINATOR, "SimpleBSH: Exceeds denominator");
    revenueShare = _revenueShare;
  }

  /// @notice Give part of the surplus to the target address
  /// @param amount The surplus amount.
  function onAddSurplus(int256 amount) external {
    require(msg.sender == address(balanceSheet), "SimpleBSH: Only balance sheet");
    processPendingShareAmount();
    if (amount > 0) {
      uint256 shareAmount = uint256(amount) * revenueShare / DENOMINATOR;
      pendingShareAmount += shareAmount;
      balanceSheet.addDeficit(int256(shareAmount));
    }
  }

  /// @notice Does nothing on deficit
  /// @param amount The deficit amount.
  function onAddDeficit(int256 amount) external {}

  /// @notice Processes the pending share amount
  function processPendingShareAmount() public {
    if (block.number > lastBlockUpdate) {
      stablecoin.mint(
        target,
        pendingShareAmount
      );
      pendingShareAmount = 0;
      lastBlockUpdate = block.number;
    }
  }
}

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

pragma solidity ^0.8.0;

import "./IERC20.sol";
import "./extensions/IERC20Metadata.sol";
import "../../utils/Context.sol";

/**
 * @dev Implementation of the {IERC20} interface.
 *
 * This implementation is agnostic to the way tokens are created. This means
 * that a supply mechanism has to be added in a derived contract using {_mint}.
 * For a generic mechanism see {ERC20PresetMinterPauser}.
 *
 * TIP: For a detailed writeup see our guide
 * https://forum.openzeppelin.com/t/how-to-implement-erc20-supply-mechanisms/226[How
 * to implement supply mechanisms].
 *
 * We have followed general OpenZeppelin Contracts guidelines: functions revert
 * instead returning `false` on failure. This behavior is nonetheless
 * conventional and does not conflict with the expectations of ERC20
 * applications.
 *
 * Additionally, an {Approval} event is emitted on calls to {transferFrom}.
 * This allows applications to reconstruct the allowance for all accounts just
 * by listening to said events. Other implementations of the EIP may not emit
 * these events, as it isn't required by the specification.
 *
 * Finally, the non-standard {decreaseAllowance} and {increaseAllowance}
 * functions have been added to mitigate the well-known issues around setting
 * allowances. See {IERC20-approve}.
 */
contract ERC20 is Context, IERC20, IERC20Metadata {
    mapping(address => uint256) private _balances;

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

    uint256 private _totalSupply;

    string private _name;
    string private _symbol;

    /**
     * @dev Sets the values for {name} and {symbol}.
     *
     * The default value of {decimals} is 18. To select a different value for
     * {decimals} you should overload it.
     *
     * All two of these values are immutable: they can only be set once during
     * construction.
     */
    constructor(string memory name_, string memory symbol_) {
        _name = name_;
        _symbol = symbol_;
    }

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

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

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

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

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

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

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

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

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

    /**
     * @dev Atomically increases the allowance granted to `spender` by the caller.
     *
     * This is an alternative to {approve} that can be used as a mitigation for
     * problems described in {IERC20-approve}.
     *
     * Emits an {Approval} event indicating the updated allowance.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     */
    function increaseAllowance(address spender, uint256 addedValue) public virtual returns (bool) {
        address owner = _msgSender();
        _approve(owner, spender, allowance(owner, spender) + addedValue);
        return true;
    }

    /**
     * @dev Atomically decreases the allowance granted to `spender` by the caller.
     *
     * This is an alternative to {approve} that can be used as a mitigation for
     * problems described in {IERC20-approve}.
     *
     * Emits an {Approval} event indicating the updated allowance.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     * - `spender` must have allowance for the caller of at least
     * `subtractedValue`.
     */
    function decreaseAllowance(address spender, uint256 subtractedValue) public virtual returns (bool) {
        address owner = _msgSender();
        uint256 currentAllowance = allowance(owner, spender);
        require(currentAllowance >= subtractedValue, "ERC20: decreased allowance below zero");
        unchecked {
            _approve(owner, spender, currentAllowance - subtractedValue);
        }

        return true;
    }

    /**
     * @dev Moves `amount` of tokens from `from` to `to`.
     *
     * This internal function is equivalent to {transfer}, and can be used to
     * e.g. implement automatic token fees, slashing mechanisms, etc.
     *
     * Emits a {Transfer} event.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `from` must have a balance of at least `amount`.
     */
    function _transfer(
        address from,
        address to,
        uint256 amount
    ) internal virtual {
        require(from != address(0), "ERC20: transfer from the zero address");
        require(to != address(0), "ERC20: transfer to the zero address");

        _beforeTokenTransfer(from, to, amount);

        uint256 fromBalance = _balances[from];
        require(fromBalance >= amount, "ERC20: transfer amount exceeds balance");
        unchecked {
            _balances[from] = fromBalance - amount;
            // Overflow not possible: the sum of all balances is capped by totalSupply, and the sum is preserved by
            // decrementing then incrementing.
            _balances[to] += amount;
        }

        emit Transfer(from, to, amount);

        _afterTokenTransfer(from, to, amount);
    }

    /** @dev Creates `amount` tokens and assigns them to `account`, increasing
     * the total supply.
     *
     * Emits a {Transfer} event with `from` set to the zero address.
     *
     * Requirements:
     *
     * - `account` cannot be the zero address.
     */
    function _mint(address account, uint256 amount) internal virtual {
        require(account != address(0), "ERC20: mint to the zero address");

        _beforeTokenTransfer(address(0), account, amount);

        _totalSupply += amount;
        unchecked {
            // Overflow not possible: balance + amount is at most totalSupply + amount, which is checked above.
            _balances[account] += amount;
        }
        emit Transfer(address(0), account, amount);

        _afterTokenTransfer(address(0), account, amount);
    }

    /**
     * @dev Destroys `amount` tokens from `account`, reducing the
     * total supply.
     *
     * Emits a {Transfer} event with `to` set to the zero address.
     *
     * Requirements:
     *
     * - `account` cannot be the zero address.
     * - `account` must have at least `amount` tokens.
     */
    function _burn(address account, uint256 amount) internal virtual {
        require(account != address(0), "ERC20: burn from the zero address");

        _beforeTokenTransfer(account, address(0), amount);

        uint256 accountBalance = _balances[account];
        require(accountBalance >= amount, "ERC20: burn amount exceeds balance");
        unchecked {
            _balances[account] = accountBalance - amount;
            // Overflow not possible: amount <= accountBalance <= totalSupply.
            _totalSupply -= amount;
        }

        emit Transfer(account, address(0), amount);

        _afterTokenTransfer(account, address(0), amount);
    }

    /**
     * @dev Sets `amount` as the allowance of `spender` over the `owner` s tokens.
     *
     * This internal function is equivalent to `approve`, and can be used to
     * e.g. set automatic allowances for certain subsystems, etc.
     *
     * Emits an {Approval} event.
     *
     * Requirements:
     *
     * - `owner` cannot be the zero address.
     * - `spender` cannot be the zero address.
     */
    function _approve(
        address owner,
        address spender,
        uint256 amount
    ) internal virtual {
        require(owner != address(0), "ERC20: approve from the zero address");
        require(spender != address(0), "ERC20: approve to the zero address");

        _allowances[owner][spender] = amount;
        emit Approval(owner, spender, amount);
    }

    /**
     * @dev Updates `owner` s allowance for `spender` based on spent `amount`.
     *
     * Does not update the allowance amount in case of infinite allowance.
     * Revert if not enough allowance is available.
     *
     * Might emit an {Approval} event.
     */
    function _spendAllowance(
        address owner,
        address spender,
        uint256 amount
    ) internal virtual {
        uint256 currentAllowance = allowance(owner, spender);
        if (currentAllowance != type(uint256).max) {
            require(currentAllowance >= amount, "ERC20: insufficient allowance");
            unchecked {
                _approve(owner, spender, currentAllowance - amount);
            }
        }
    }

    /**
     * @dev Hook that is called before any transfer of tokens. This includes
     * minting and burning.
     *
     * Calling conditions:
     *
     * - when `from` and `to` are both non-zero, `amount` of ``from``'s tokens
     * will be transferred to `to`.
     * - when `from` is zero, `amount` tokens will be minted for `to`.
     * - when `to` is zero, `amount` of ``from``'s tokens will be burned.
     * - `from` and `to` are never both zero.
     *
     * To learn more about hooks, head to xref:ROOT:extending-contracts.adoc#using-hooks[Using Hooks].
     */
    function _beforeTokenTransfer(
        address from,
        address to,
        uint256 amount
    ) internal virtual {}

    /**
     * @dev Hook that is called after any transfer of tokens. This includes
     * minting and burning.
     *
     * Calling conditions:
     *
     * - when `from` and `to` are both non-zero, `amount` of ``from``'s tokens
     * has been transferred to `to`.
     * - when `from` is zero, `amount` tokens have been minted for `to`.
     * - when `to` is zero, `amount` of ``from``'s tokens have been burned.
     * - `from` and `to` are never both zero.
     *
     * To learn more about hooks, head to xref:ROOT:extending-contracts.adoc#using-hooks[Using Hooks].
     */
    function _afterTokenTransfer(
        address from,
        address to,
        uint256 amount
    ) internal virtual {}
}

// SPDX-License-Identifier: Unlicense
pragma solidity >=0.8.4;

/// @notice Emitted when the result overflows uint256.
error PRBMath__MulDivFixedPointOverflow(uint256 prod1);

/// @notice Emitted when the result overflows uint256.
error PRBMath__MulDivOverflow(uint256 prod1, uint256 denominator);

/// @notice Emitted when one of the inputs is type(int256).min.
error PRBMath__MulDivSignedInputTooSmall();

/// @notice Emitted when the intermediary absolute result overflows int256.
error PRBMath__MulDivSignedOverflow(uint256 rAbs);

/// @notice Emitted when the input is MIN_SD59x18.
error PRBMathSD59x18__AbsInputTooSmall();

/// @notice Emitted when ceiling a number overflows SD59x18.
error PRBMathSD59x18__CeilOverflow(int256 x);

/// @notice Emitted when one of the inputs is MIN_SD59x18.
error PRBMathSD59x18__DivInputTooSmall();

/// @notice Emitted when one of the intermediary unsigned results overflows SD59x18.
error PRBMathSD59x18__DivOverflow(uint256 rAbs);

/// @notice Emitted when the input is greater than 133.084258667509499441.
error PRBMathSD59x18__ExpInputTooBig(int256 x);

/// @notice Emitted when the input is greater than 192.
error PRBMathSD59x18__Exp2InputTooBig(int256 x);

/// @notice Emitted when flooring a number underflows SD59x18.
error PRBMathSD59x18__FloorUnderflow(int256 x);

/// @notice Emitted when converting a basic integer to the fixed-point format overflows SD59x18.
error PRBMathSD59x18__FromIntOverflow(int256 x);

/// @notice Emitted when converting a basic integer to the fixed-point format underflows SD59x18.
error PRBMathSD59x18__FromIntUnderflow(int256 x);

/// @notice Emitted when the product of the inputs is negative.
error PRBMathSD59x18__GmNegativeProduct(int256 x, int256 y);

/// @notice Emitted when multiplying the inputs overflows SD59x18.
error PRBMathSD59x18__GmOverflow(int256 x, int256 y);

/// @notice Emitted when the input is less than or equal to zero.
error PRBMathSD59x18__LogInputTooSmall(int256 x);

/// @notice Emitted when one of the inputs is MIN_SD59x18.
error PRBMathSD59x18__MulInputTooSmall();

/// @notice Emitted when the intermediary absolute result overflows SD59x18.
error PRBMathSD59x18__MulOverflow(uint256 rAbs);

/// @notice Emitted when the intermediary absolute result overflows SD59x18.
error PRBMathSD59x18__PowuOverflow(uint256 rAbs);

/// @notice Emitted when the input is negative.
error PRBMathSD59x18__SqrtNegativeInput(int256 x);

/// @notice Emitted when the calculating the square root overflows SD59x18.
error PRBMathSD59x18__SqrtOverflow(int256 x);

/// @notice Emitted when addition overflows UD60x18.
error PRBMathUD60x18__AddOverflow(uint256 x, uint256 y);

/// @notice Emitted when ceiling a number overflows UD60x18.
error PRBMathUD60x18__CeilOverflow(uint256 x);

/// @notice Emitted when the input is greater than 133.084258667509499441.
error PRBMathUD60x18__ExpInputTooBig(uint256 x);

/// @notice Emitted when the input is greater than 192.
error PRBMathUD60x18__Exp2InputTooBig(uint256 x);

/// @notice Emitted when converting a basic integer to the fixed-point format format overflows UD60x18.
error PRBMathUD60x18__FromUintOverflow(uint256 x);

/// @notice Emitted when multiplying the inputs overflows UD60x18.
error PRBMathUD60x18__GmOverflow(uint256 x, uint256 y);

/// @notice Emitted when the input is less than 1.
error PRBMathUD60x18__LogInputTooSmall(uint256 x);

/// @notice Emitted when the calculating the square root overflows UD60x18.
error PRBMathUD60x18__SqrtOverflow(uint256 x);

/// @notice Emitted when subtraction underflows UD60x18.
error PRBMathUD60x18__SubUnderflow(uint256 x, uint256 y);

/// @dev Common mathematical functions used in both PRBMathSD59x18 and PRBMathUD60x18. Note that this shared library
/// does not always assume the signed 59.18-decimal fixed-point or the unsigned 60.18-decimal fixed-point
/// representation. When it does not, it is explicitly mentioned in the NatSpec documentation.
library PRBMath {
    /// STRUCTS ///

    struct SD59x18 {
        int256 value;
    }

    struct UD60x18 {
        uint256 value;
    }

    /// STORAGE ///

    /// @dev How many trailing decimals can be represented.
    uint256 internal constant SCALE = 1e18;

    /// @dev Largest power of two divisor of SCALE.
    uint256 internal constant SCALE_LPOTD = 262144;

    /// @dev SCALE inverted mod 2^256.
    uint256 internal constant SCALE_INVERSE =
        78156646155174841979727994598816262306175212592076161876661_508869554232690281;

    /// FUNCTIONS ///

    /// @notice Calculates the binary exponent of x using the binary fraction method.
    /// @dev Has to use 192.64-bit fixed-point numbers.
    /// See https://ethereum.stackexchange.com/a/96594/24693.
    /// @param x The exponent as an unsigned 192.64-bit fixed-point number.
    /// @return result The result as an unsigned 60.18-decimal fixed-point number.
    function exp2(uint256 x) internal pure returns (uint256 result) {
        unchecked {
            // Start from 0.5 in the 192.64-bit fixed-point format.
            result = 0x800000000000000000000000000000000000000000000000;

            // Multiply the result by root(2, 2^-i) when the bit at position i is 1. None of the intermediary results overflows
            // because the initial result is 2^191 and all magic factors are less than 2^65.
            if (x & 0x8000000000000000 > 0) {
                result = (result * 0x16A09E667F3BCC909) >> 64;
            }
            if (x & 0x4000000000000000 > 0) {
                result = (result * 0x1306FE0A31B7152DF) >> 64;
            }
            if (x & 0x2000000000000000 > 0) {
                result = (result * 0x1172B83C7D517ADCE) >> 64;
            }
            if (x & 0x1000000000000000 > 0) {
                result = (result * 0x10B5586CF9890F62A) >> 64;
            }
            if (x & 0x800000000000000 > 0) {
                result = (result * 0x1059B0D31585743AE) >> 64;
            }
            if (x & 0x400000000000000 > 0) {
                result = (result * 0x102C9A3E778060EE7) >> 64;
            }
            if (x & 0x200000000000000 > 0) {
                result = (result * 0x10163DA9FB33356D8) >> 64;
            }
            if (x & 0x100000000000000 > 0) {
                result = (result * 0x100B1AFA5ABCBED61) >> 64;
            }
            if (x & 0x80000000000000 > 0) {
                result = (result * 0x10058C86DA1C09EA2) >> 64;
            }
            if (x & 0x40000000000000 > 0) {
                result = (result * 0x1002C605E2E8CEC50) >> 64;
            }
            if (x & 0x20000000000000 > 0) {
                result = (result * 0x100162F3904051FA1) >> 64;
            }
            if (x & 0x10000000000000 > 0) {
                result = (result * 0x1000B175EFFDC76BA) >> 64;
            }
            if (x & 0x8000000000000 > 0) {
                result = (result * 0x100058BA01FB9F96D) >> 64;
            }
            if (x & 0x4000000000000 > 0) {
                result = (result * 0x10002C5CC37DA9492) >> 64;
            }
            if (x & 0x2000000000000 > 0) {
                result = (result * 0x1000162E525EE0547) >> 64;
            }
            if (x & 0x1000000000000 > 0) {
                result = (result * 0x10000B17255775C04) >> 64;
            }
            if (x & 0x800000000000 > 0) {
                result = (result * 0x1000058B91B5BC9AE) >> 64;
            }
            if (x & 0x400000000000 > 0) {
                result = (result * 0x100002C5C89D5EC6D) >> 64;
            }
            if (x & 0x200000000000 > 0) {
                result = (result * 0x10000162E43F4F831) >> 64;
            }
            if (x & 0x100000000000 > 0) {
                result = (result * 0x100000B1721BCFC9A) >> 64;
            }
            if (x & 0x80000000000 > 0) {
                result = (result * 0x10000058B90CF1E6E) >> 64;
            }
            if (x & 0x40000000000 > 0) {
                result = (result * 0x1000002C5C863B73F) >> 64;
            }
            if (x & 0x20000000000 > 0) {
                result = (result * 0x100000162E430E5A2) >> 64;
            }
            if (x & 0x10000000000 > 0) {
                result = (result * 0x1000000B172183551) >> 64;
            }
            if (x & 0x8000000000 > 0) {
                result = (result * 0x100000058B90C0B49) >> 64;
            }
            if (x & 0x4000000000 > 0) {
                result = (result * 0x10000002C5C8601CC) >> 64;
            }
            if (x & 0x2000000000 > 0) {
                result = (result * 0x1000000162E42FFF0) >> 64;
            }
            if (x & 0x1000000000 > 0) {
                result = (result * 0x10000000B17217FBB) >> 64;
            }
            if (x & 0x800000000 > 0) {
                result = (result * 0x1000000058B90BFCE) >> 64;
            }
            if (x & 0x400000000 > 0) {
                result = (result * 0x100000002C5C85FE3) >> 64;
            }
            if (x & 0x200000000 > 0) {
                result = (result * 0x10000000162E42FF1) >> 64;
            }
            if (x & 0x100000000 > 0) {
                result = (result * 0x100000000B17217F8) >> 64;
            }
            if (x & 0x80000000 > 0) {
                result = (result * 0x10000000058B90BFC) >> 64;
            }
            if (x & 0x40000000 > 0) {
                result = (result * 0x1000000002C5C85FE) >> 64;
            }
            if (x & 0x20000000 > 0) {
                result = (result * 0x100000000162E42FF) >> 64;
            }
            if (x & 0x10000000 > 0) {
                result = (result * 0x1000000000B17217F) >> 64;
            }
            if (x & 0x8000000 > 0) {
                result = (result * 0x100000000058B90C0) >> 64;
            }
            if (x & 0x4000000 > 0) {
                result = (result * 0x10000000002C5C860) >> 64;
            }
            if (x & 0x2000000 > 0) {
                result = (result * 0x1000000000162E430) >> 64;
            }
            if (x & 0x1000000 > 0) {
                result = (result * 0x10000000000B17218) >> 64;
            }
            if (x & 0x800000 > 0) {
                result = (result * 0x1000000000058B90C) >> 64;
            }
            if (x & 0x400000 > 0) {
                result = (result * 0x100000000002C5C86) >> 64;
            }
            if (x & 0x200000 > 0) {
                result = (result * 0x10000000000162E43) >> 64;
            }
            if (x & 0x100000 > 0) {
                result = (result * 0x100000000000B1721) >> 64;
            }
            if (x & 0x80000 > 0) {
                result = (result * 0x10000000000058B91) >> 64;
            }
            if (x & 0x40000 > 0) {
                result = (result * 0x1000000000002C5C8) >> 64;
            }
            if (x & 0x20000 > 0) {
                result = (result * 0x100000000000162E4) >> 64;
            }
            if (x & 0x10000 > 0) {
                result = (result * 0x1000000000000B172) >> 64;
            }
            if (x & 0x8000 > 0) {
                result = (result * 0x100000000000058B9) >> 64;
            }
            if (x & 0x4000 > 0) {
                result = (result * 0x10000000000002C5D) >> 64;
            }
            if (x & 0x2000 > 0) {
                result = (result * 0x1000000000000162E) >> 64;
            }
            if (x & 0x1000 > 0) {
                result = (result * 0x10000000000000B17) >> 64;
            }
            if (x & 0x800 > 0) {
                result = (result * 0x1000000000000058C) >> 64;
            }
            if (x & 0x400 > 0) {
                result = (result * 0x100000000000002C6) >> 64;
            }
            if (x & 0x200 > 0) {
                result = (result * 0x10000000000000163) >> 64;
            }
            if (x & 0x100 > 0) {
                result = (result * 0x100000000000000B1) >> 64;
            }
            if (x & 0x80 > 0) {
                result = (result * 0x10000000000000059) >> 64;
            }
            if (x & 0x40 > 0) {
                result = (result * 0x1000000000000002C) >> 64;
            }
            if (x & 0x20 > 0) {
                result = (result * 0x10000000000000016) >> 64;
            }
            if (x & 0x10 > 0) {
                result = (result * 0x1000000000000000B) >> 64;
            }
            if (x & 0x8 > 0) {
                result = (result * 0x10000000000000006) >> 64;
            }
            if (x & 0x4 > 0) {
                result = (result * 0x10000000000000003) >> 64;
            }
            if (x & 0x2 > 0) {
                result = (result * 0x10000000000000001) >> 64;
            }
            if (x & 0x1 > 0) {
                result = (result * 0x10000000000000001) >> 64;
            }

            // We're doing two things at the same time:
            //
            //   1. Multiply the result by 2^n + 1, where "2^n" is the integer part and the one is added to account for
            //      the fact that we initially set the result to 0.5. This is accomplished by subtracting from 191
            //      rather than 192.
            //   2. Convert the result to the unsigned 60.18-decimal fixed-point format.
            //
            // This works because 2^(191-ip) = 2^ip / 2^191, where "ip" is the integer part "2^n".
            result *= SCALE;
            result >>= (191 - (x >> 64));
        }
    }

    /// @notice Finds the zero-based index of the first one in the binary representation of x.
    /// @dev See the note on msb in the "Find First Set" Wikipedia article https://en.wikipedia.org/wiki/Find_first_set
    /// @param x The uint256 number for which to find the index of the most significant bit.
    /// @return msb The index of the most significant bit as an uint256.
    function mostSignificantBit(uint256 x) internal pure returns (uint256 msb) {
        if (x >= 2**128) {
            x >>= 128;
            msb += 128;
        }
        if (x >= 2**64) {
            x >>= 64;
            msb += 64;
        }
        if (x >= 2**32) {
            x >>= 32;
            msb += 32;
        }
        if (x >= 2**16) {
            x >>= 16;
            msb += 16;
        }
        if (x >= 2**8) {
            x >>= 8;
            msb += 8;
        }
        if (x >= 2**4) {
            x >>= 4;
            msb += 4;
        }
        if (x >= 2**2) {
            x >>= 2;
            msb += 2;
        }
        if (x >= 2**1) {
            // No need to shift x any more.
            msb += 1;
        }
    }

    /// @notice Calculates floor(x*y÷denominator) with full precision.
    ///
    /// @dev Credit to Remco Bloemen under MIT license https://xn--2-umb.com/21/muldiv.
    ///
    /// Requirements:
    /// - The denominator cannot be zero.
    /// - The result must fit within uint256.
    ///
    /// Caveats:
    /// - This function does not work with fixed-point numbers.
    ///
    /// @param x The multiplicand as an uint256.
    /// @param y The multiplier as an uint256.
    /// @param denominator The divisor as an uint256.
    /// @return result The result as an uint256.
    function mulDiv(
        uint256 x,
        uint256 y,
        uint256 denominator
    ) internal pure returns (uint256 result) {
        // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use
        // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
        // variables such that product = prod1 * 2^256 + prod0.
        uint256 prod0; // Least significant 256 bits of the product
        uint256 prod1; // Most significant 256 bits of the product
        assembly {
            let mm := mulmod(x, y, not(0))
            prod0 := mul(x, y)
            prod1 := sub(sub(mm, prod0), lt(mm, prod0))
        }

        // Handle non-overflow cases, 256 by 256 division.
        if (prod1 == 0) {
            unchecked {
                result = prod0 / denominator;
            }
            return result;
        }

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

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

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

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

        // Factor powers of two out of denominator and compute largest power of two divisor of denominator. Always >= 1.
        // See https://cs.stackexchange.com/q/138556/92363.
        unchecked {
            // Does not overflow because the denominator cannot be zero at this stage in the function.
            uint256 lpotdod = denominator & (~denominator + 1);
            assembly {
                // Divide denominator by lpotdod.
                denominator := div(denominator, lpotdod)

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

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

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

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

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works
            // in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2^8
            inverse *= 2 - denominator * inverse; // inverse mod 2^16
            inverse *= 2 - denominator * inverse; // inverse mod 2^32
            inverse *= 2 - denominator * inverse; // inverse mod 2^64
            inverse *= 2 - denominator * inverse; // inverse mod 2^128
            inverse *= 2 - denominator * inverse; // inverse mod 2^256

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

    /// @notice Calculates floor(x*y÷1e18) with full precision.
    ///
    /// @dev Variant of "mulDiv" with constant folding, i.e. in which the denominator is always 1e18. Before returning the
    /// final result, we add 1 if (x * y) % SCALE >= HALF_SCALE. Without this, 6.6e-19 would be truncated to 0 instead of
    /// being rounded to 1e-18.  See "Listing 6" and text above it at https://accu.org/index.php/journals/1717.
    ///
    /// Requirements:
    /// - The result must fit within uint256.
    ///
    /// Caveats:
    /// - The body is purposely left uncommented; see the NatSpec comments in "PRBMath.mulDiv" to understand how this works.
    /// - It is assumed that the result can never be type(uint256).max when x and y solve the following two equations:
    ///     1. x * y = type(uint256).max * SCALE
    ///     2. (x * y) % SCALE >= SCALE / 2
    ///
    /// @param x The multiplicand as an unsigned 60.18-decimal fixed-point number.
    /// @param y The multiplier as an unsigned 60.18-decimal fixed-point number.
    /// @return result The result as an unsigned 60.18-decimal fixed-point number.
    function mulDivFixedPoint(uint256 x, uint256 y) internal pure returns (uint256 result) {
        uint256 prod0;
        uint256 prod1;
        assembly {
            let mm := mulmod(x, y, not(0))
            prod0 := mul(x, y)
            prod1 := sub(sub(mm, prod0), lt(mm, prod0))
        }

        if (prod1 >= SCALE) {
            revert PRBMath__MulDivFixedPointOverflow(prod1);
        }

        uint256 remainder;
        uint256 roundUpUnit;
        assembly {
            remainder := mulmod(x, y, SCALE)
            roundUpUnit := gt(remainder, 499999999999999999)
        }

        if (prod1 == 0) {
            unchecked {
                result = (prod0 / SCALE) + roundUpUnit;
                return result;
            }
        }

        assembly {
            result := add(
                mul(
                    or(
                        div(sub(prod0, remainder), SCALE_LPOTD),
                        mul(sub(prod1, gt(remainder, prod0)), add(div(sub(0, SCALE_LPOTD), SCALE_LPOTD), 1))
                    ),
                    SCALE_INVERSE
                ),
                roundUpUnit
            )
        }
    }

    /// @notice Calculates floor(x*y÷denominator) with full precision.
    ///
    /// @dev An extension of "mulDiv" for signed numbers. Works by computing the signs and the absolute values separately.
    ///
    /// Requirements:
    /// - None of the inputs can be type(int256).min.
    /// - The result must fit within int256.
    ///
    /// @param x The multiplicand as an int256.
    /// @param y The multiplier as an int256.
    /// @param denominator The divisor as an int256.
    /// @return result The result as an int256.
    function mulDivSigned(
        int256 x,
        int256 y,
        int256 denominator
    ) internal pure returns (int256 result) {
        if (x == type(int256).min || y == type(int256).min || denominator == type(int256).min) {
            revert PRBMath__MulDivSignedInputTooSmall();
        }

        // Get hold of the absolute values of x, y and the denominator.
        uint256 ax;
        uint256 ay;
        uint256 ad;
        unchecked {
            ax = x < 0 ? uint256(-x) : uint256(x);
            ay = y < 0 ? uint256(-y) : uint256(y);
            ad = denominator < 0 ? uint256(-denominator) : uint256(denominator);
        }

        // Compute the absolute value of (x*y)÷denominator. The result must fit within int256.
        uint256 rAbs = mulDiv(ax, ay, ad);
        if (rAbs > uint256(type(int256).max)) {
            revert PRBMath__MulDivSignedOverflow(rAbs);
        }

        // Get the signs of x, y and the denominator.
        uint256 sx;
        uint256 sy;
        uint256 sd;
        assembly {
            sx := sgt(x, sub(0, 1))
            sy := sgt(y, sub(0, 1))
            sd := sgt(denominator, sub(0, 1))
        }

        // XOR over sx, sy and sd. This is checking whether there are one or three negative signs in the inputs.
        // If yes, the result should be negative.
        result = sx ^ sy ^ sd == 0 ? -int256(rAbs) : int256(rAbs);
    }

    /// @notice Calculates the square root of x, rounding down.
    /// @dev Uses the Babylonian method https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method.
    ///
    /// Caveats:
    /// - This function does not work with fixed-point numbers.
    ///
    /// @param x The uint256 number for which to calculate the square root.
    /// @return result The result as an uint256.
    function sqrt(uint256 x) internal pure returns (uint256 result) {
        if (x == 0) {
            return 0;
        }

        // Set the initial guess to the least power of two that is greater than or equal to sqrt(x).
        uint256 xAux = uint256(x);
        result = 1;
        if (xAux >= 0x100000000000000000000000000000000) {
            xAux >>= 128;
            result <<= 64;
        }
        if (xAux >= 0x10000000000000000) {
            xAux >>= 64;
            result <<= 32;
        }
        if (xAux >= 0x100000000) {
            xAux >>= 32;
            result <<= 16;
        }
        if (xAux >= 0x10000) {
            xAux >>= 16;
            result <<= 8;
        }
        if (xAux >= 0x100) {
            xAux >>= 8;
            result <<= 4;
        }
        if (xAux >= 0x10) {
            xAux >>= 4;
            result <<= 2;
        }
        if (xAux >= 0x4) {
            result <<= 1;
        }

        // The operations can never overflow because the result is max 2^127 when it enters this block.
        unchecked {
            result = (result + x / result) >> 1;
            result = (result + x / result) >> 1;
            result = (result + x / result) >> 1;
            result = (result + x / result) >> 1;
            result = (result + x / result) >> 1;
            result = (result + x / result) >> 1;
            result = (result + x / result) >> 1; // Seven iterations should be enough
            uint256 roundedDownResult = x / result;
            return result >= roundedDownResult ? roundedDownResult : result;
        }
    }
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

import "./templates/YSSModule.sol";
import "../interfaces/IBalanceSheetHandler.sol";

/// @notice Keeps track of protocol deficit/surplus.
contract BalanceSheetModule is YSSModule {

  /// @notice The protocol surplus.
  int256 public totalSurplus;

  /// @notice Called when a protocol surplus or deficit is registered.
  IBalanceSheetHandler public handler;

  /// @notice Emitted when a protocol surplus is registered.
  /// @param account The account that registered the surplus.
  /// @param amount The surplus amount.
  event AddSurplus(address indexed account, int256 amount);

  /// @notice Emitted when a protocol deficit is registered.
  /// @param account The account that registered the deficit.
  /// @param amount The deficit amount.
  event AddDeficit(address indexed account, int256 amount);

  /// @notice Emitted when the protocol surplus is set.
  /// @param account The account that set the surplus.
  event SetSurplus(address indexed account, int256 amount);

  /// @notice Sets the stablecoin address
  constructor(YSS _stablecoin) YSSModule(_stablecoin) {}

  /// @notice Sets the handler
  /// @param _handler Handler to set
  function setHandler(IBalanceSheetHandler _handler) external onlyAllowlist {
    handler = _handler;
  }

  /// @notice Registers a protocol surplus
  /// @param amount The surplus amount.
  function addSurplus(int256 amount) external onlyAllowlist {
    totalSurplus += amount;
    emit AddSurplus(msg.sender, amount);
    if (address(handler) != address(0)) {
      handler.onAddSurplus(amount);
    }
  }

  /// @notice Registers a protocol deficit
  /// @param amount The deficit amount.
  function addDeficit(int256 amount) external onlyAllowlist {
    totalSurplus -= amount;
    emit AddDeficit(msg.sender, amount);
    if (address(handler) != address(0)) {
      handler.onAddDeficit(amount);
    }
  }

  /// @notice Sets the protocol surplus
  /// @param amount The surplus amount.
  function setSurplus(int256 amount) external onlyAllowlist {
    totalSurplus = amount;
    emit SetSurplus(msg.sender, amount);
  }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)

pragma solidity ^0.8.0;

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (token/ERC20/extensions/IERC20Permit.sol)

pragma solidity ^0.8.0;

/**
 * @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in
 * https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].
 *
 * Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by
 * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't
 * need to send a transaction, and thus is not required to hold Ether at all.
 */
interface IERC20Permit {
    /**
     * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
     * given ``owner``'s signed approval.
     *
     * IMPORTANT: The same issues {IERC20-approve} has related to transaction
     * ordering also apply here.
     *
     * Emits an {Approval} event.
     *
     * Requirements:
     *
     * - `spender` cannot be the zero address.
     * - `deadline` must be a timestamp in the future.
     * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
     * over the EIP712-formatted function arguments.
     * - the signature must use ``owner``'s current nonce (see {nonces}).
     *
     * For more information on the signature format, see the
     * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
     * section].
     */
    function permit(
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) external;

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/Address.sol)

pragma solidity ^0.8.1;

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev Returns true if `account` is a contract.
     *
     * [IMPORTANT]
     * ====
     * It is unsafe to assume that an address for which this function returns
     * false is an externally-owned account (EOA) and not a contract.
     *
     * Among others, `isContract` will return false for the following
     * types of addresses:
     *
     *  - an externally-owned account
     *  - a contract in construction
     *  - an address where a contract will be created
     *  - an address where a contract lived, but was destroyed
     * ====
     *
     * [IMPORTANT]
     * ====
     * You shouldn't rely on `isContract` to protect against flash loan attacks!
     *
     * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets
     * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract
     * constructor.
     * ====
     */
    function isContract(address account) internal view returns (bool) {
        // This method relies on extcodesize/address.code.length, which returns 0
        // for contracts in construction, since the code is only stored at the end
        // of the constructor execution.

        return account.code.length > 0;
    }

    /**
     * @dev Replacement for Solidity's `transfer`: sends `amount` wei to
     * `recipient`, forwarding all available gas and reverting on errors.
     *
     * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
     * of certain opcodes, possibly making contracts go over the 2300 gas limit
     * imposed by `transfer`, making them unable to receive funds via
     * `transfer`. {sendValue} removes this limitation.
     *
     * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].
     *
     * IMPORTANT: because control is transferred to `recipient`, care must be
     * taken to not create reentrancy vulnerabilities. Consider using
     * {ReentrancyGuard} or the
     * https://solidity.readthedocs.io/en/v0.5.11/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
     */
    function sendValue(address payable recipient, uint256 amount) internal {
        require(address(this).balance >= amount, "Address: insufficient balance");

        (bool success, ) = recipient.call{value: amount}("");
        require(success, "Address: unable to send value, recipient may have reverted");
    }

    /**
     * @dev Performs a Solidity function call using a low level `call`. A
     * plain `call` is an unsafe replacement for a function call: use this
     * function instead.
     *
     * If `target` reverts with a revert reason, it is bubbled up by this
     * function (like regular Solidity function calls).
     *
     * Returns the raw returned data. To convert to the expected return value,
     * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
     *
     * Requirements:
     *
     * - `target` must be a contract.
     * - calling `target` with `data` must not revert.
     *
     * _Available since v3.1._
     */
    function functionCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, "Address: low-level call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with
     * `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but also transferring `value` wei to `target`.
     *
     * Requirements:
     *
     * - the calling contract must have an ETH balance of at least `value`.
     * - the called Solidity function must be `payable`.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, value, "Address: low-level call with value failed");
    }

    /**
     * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but
     * with `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value,
        string memory errorMessage
    ) internal returns (bytes memory) {
        require(address(this).balance >= value, "Address: insufficient balance for call");
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
        return functionStaticCall(target, data, "Address: low-level static call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        (bool success, bytes memory returndata) = target.staticcall(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionDelegateCall(target, data, "Address: low-level delegate call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        (bool success, bytes memory returndata) = target.delegatecall(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling
     * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.
     *
     * _Available since v4.8._
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        if (success) {
            if (returndata.length == 0) {
                // only check isContract if the call was successful and the return data is empty
                // otherwise we already know that it was a contract
                require(isContract(target), "Address: call to non-contract");
            }
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the
     * revert reason or using the provided one.
     *
     * _Available since v4.3._
     */
    function verifyCallResult(
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal pure returns (bytes memory) {
        if (success) {
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    function _revert(bytes memory returndata, string memory errorMessage) private pure {
        // Look for revert reason and bubble it up if present
        if (returndata.length > 0) {
            // The easiest way to bubble the revert reason is using memory via assembly
            /// @solidity memory-safe-assembly
            assembly {
                let returndata_size := mload(returndata)
                revert(add(32, returndata), returndata_size)
            }
        } else {
            revert(errorMessage);
        }
    }
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

import "./ModularToken.sol";

/// @notice Yama stablecoin.
contract YSS is ModularToken {
  constructor() ModularToken(0, "Yama Settlement Standard", "YAMA") {}
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

/// @notice Provides a utility function for converting amounts between tokens with different decimal places.
abstract contract Module {
  /// @notice Converts an amount between tokens with different decimal places
  /// @param amount The amount to convert
  /// @param fromDecimals The number of decimals of the token to convert from
  /// @param toDecimals The number of decimals of the token to convert to
  /// @return result The converted amount
  function convertAmount(
    uint256 amount, uint8 fromDecimals, uint8 toDecimals
  ) internal pure returns (uint256 result) {
    if (fromDecimals == toDecimals) {
      return amount;
    } else if (fromDecimals < toDecimals) {
      return amount * (10 ** (toDecimals - fromDecimals));
    } else {
      return amount / (10 ** (fromDecimals - toDecimals));
    }
  }
}

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

/// @notice Called when a protocol surplus or deficit is registered.
interface IBalanceSheetHandler {

  /// @notice Called when a protocol surplus is registered.
  /// @param amount The surplus amount.
  function onAddSurplus(int256 amount) external;

  /// @notice Called when a protocol deficit is registered.
  /// @param amount The deficit amount.
  function onAddDeficit(int256 amount) external;
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (token/ERC20/extensions/IERC20Metadata.sol)

pragma solidity ^0.8.0;

import "../IERC20.sol";

/**
 * @dev Interface for the optional metadata functions from the ERC20 standard.
 *
 * _Available since v4.1._
 */
interface IERC20Metadata is IERC20 {
    /**
     * @dev Returns the name of the token.
     */
    function name() external view returns (string memory);

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

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

// SPDX-License-Identifier: BUSL-1.1
pragma solidity 0.8.18;

import "@openzeppelin/contracts/token/ERC20/ERC20.sol";
import "@openzeppelin/contracts/token/ERC20/extensions/ERC20Permit.sol";

/// @notice Template for modular tokens with an allowlist to manage minting/burning
contract ModularToken is ERC20, ERC20Permit {
  /// @notice Allowed addresses can mint/burn the token.
  mapping(address => bool) public allowlist;
  
  /// @notice Emitted when an address is added/removed from the allowlist
  /// @param account Address that was added/removed
  /// @param isAllowed Whether the address is allowed
  event SetAllowlist(address indexed account, bool isAllowed);

  /// @notice Restricts execution of a function to allowed contracts
  modifier onlyAllowlist() {
    require(allowlist[msg.sender], "ModularToken: Sender not allowed");
    _;
  }

  /// @notice Constructor
  /// @param mintAmount Amount of tokens to mint
  /// @param name Name of the token
  /// @param symbol Symbol of the token
  constructor(
    uint256 mintAmount,
    string memory name,
    string memory symbol
  ) ERC20(name, symbol) ERC20Permit(name) {
    _mint(msg.sender, mintAmount);
    allowlist[msg.sender] = true;
    setAllowlist(msg.sender, true);
  }

  /// @notice Sets the allowlist status of an address
  /// @param account Address to set
  /// @param isAllowed Whether the address is allowed
  function setAllowlist(
    address account,
    bool isAllowed
  ) public onlyAllowlist {
    allowlist[account] = isAllowed;

    emit SetAllowlist(account, isAllowed);
  }

  /// @notice Used by allowed contracts to mint tokens
  /// @param account Address that receives tokens
  /// @param amount Amount of tokens to mint
  function mint(
    address account,
    uint256 amount
  ) external onlyAllowlist {
    _mint(account, amount);
  }

  /// @notice Used by allowed contracts to burn tokens
  /// @param account Address where tokens are burned
  /// @param amount Amount of tokens to burn
  function burn(
    address account,
    uint256 amount
  ) external onlyAllowlist {
    _burn(account, amount);
  }

  /// @notice Used by allowed contracts to modify token allowances
  /// @param owner Address that owns the tokens
  /// @param spender Address that is allowed to spend the tokens
  /// @param amount Amount of tokens that are allowed to be spent
  function approve(
    address owner,
    address spender,
    uint256 amount
  ) external onlyAllowlist {
    _approve(owner, spender, amount);
  }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.6.0) (token/ERC20/extensions/ERC20Permit.sol)

pragma solidity ^0.8.0;

import "./IERC20Permit.sol";
import "../ERC20.sol";
import "../../../utils/cryptography/ECDSA.sol";
import "../../../utils/cryptography/EIP712.sol";
import "../../../utils/Counters.sol";

/**
 * @dev Implementation of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in
 * https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].
 *
 * Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by
 * presenting a message signed by the account. By not relying on `{IERC20-approve}`, the token holder account doesn't
 * need to send a transaction, and thus is not required to hold Ether at all.
 *
 * _Available since v3.4._
 */
abstract contract ERC20Permit is ERC20, IERC20Permit, EIP712 {
    using Counters for Counters.Counter;

    mapping(address => Counters.Counter) private _nonces;

    // solhint-disable-next-line var-name-mixedcase
    bytes32 private constant _PERMIT_TYPEHASH =
        keccak256("Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)");
    /**
     * @dev In previous versions `_PERMIT_TYPEHASH` was declared as `immutable`.
     * However, to ensure consistency with the upgradeable transpiler, we will continue
     * to reserve a slot.
     * @custom:oz-renamed-from _PERMIT_TYPEHASH
     */
    // solhint-disable-next-line var-name-mixedcase
    bytes32 private _PERMIT_TYPEHASH_DEPRECATED_SLOT;

    /**
     * @dev Initializes the {EIP712} domain separator using the `name` parameter, and setting `version` to `"1"`.
     *
     * It's a good idea to use the same `name` that is defined as the ERC20 token name.
     */
    constructor(string memory name) EIP712(name, "1") {}

    /**
     * @dev See {IERC20Permit-permit}.
     */
    function permit(
        address owner,
        address spender,
        uint256 value,
        uint256 deadline,
        uint8 v,
        bytes32 r,
        bytes32 s
    ) public virtual override {
        require(block.timestamp <= deadline, "ERC20Permit: expired deadline");

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

        bytes32 hash = _hashTypedDataV4(structHash);

        address signer = ECDSA.recover(hash, v, r, s);
        require(signer == owner, "ERC20Permit: invalid signature");

        _approve(owner, spender, value);
    }

    /**
     * @dev See {IERC20Permit-nonces}.
     */
    function nonces(address owner) public view virtual override returns (uint256) {
        return _nonces[owner].current();
    }

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

    /**
     * @dev "Consume a nonce": return the current value and increment.
     *
     * _Available since v4.1._
     */
    function _useNonce(address owner) internal virtual returns (uint256 current) {
        Counters.Counter storage nonce = _nonces[owner];
        current = nonce.current();
        nonce.increment();
    }
}

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

pragma solidity ^0.8.0;

import "../Strings.sol";

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

    function _throwError(RecoverError error) private pure {
        if (error == RecoverError.NoError) {
            return; // no error: do nothing
        } else if (error == RecoverError.InvalidSignature) {
            revert("ECDSA: invalid signature");
        } else if (error == RecoverError.InvalidSignatureLength) {
            revert("ECDSA: invalid signature length");
        } else if (error == RecoverError.InvalidSignatureS) {
            revert("ECDSA: invalid signature 's' value");
        }
    }

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

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

    /**
     * @dev Overload of {ECDSA-tryRecover} that receives the `r` and `vs` short-signature fields separately.
     *
     * See https://eips.ethereum.org/EIPS/eip-2098[EIP-2098 short signatures]
     *
     * _Available since v4.3._
     */
    function tryRecover(
        bytes32 hash,
        bytes32 r,
        bytes32 vs
    ) internal pure returns (address, RecoverError) {
        bytes32 s = vs & bytes32(0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff);
        uint8 v = uint8((uint256(vs) >> 255) + 27);
        return tryRecover(hash, v, r, s);
    }

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

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

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

        return (signer, RecoverError.NoError);
    }

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

    /**
     * @dev Returns an Ethereum Signed Message, created from a `hash`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes32 hash) internal pure returns (bytes32) {
        // 32 is the length in bytes of hash,
        // enforced by the type signature above
        return keccak256(abi.encodePacked("\x19Ethereum Signed Message:\n32", hash));
    }

    /**
     * @dev Returns an Ethereum Signed Message, created from `s`. This
     * produces hash corresponding to the one signed with the
     * https://eth.wiki/json-rpc/API#eth_sign[`eth_sign`]
     * JSON-RPC method as part of EIP-191.
     *
     * See {recover}.
     */
    function toEthSignedMessageHash(bytes memory s) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19Ethereum Signed Message:\n", Strings.toString(s.length), s));
    }

    /**
     * @dev Returns an Ethereum Signed Typed Data, created from a
     * `domainSeparator` and a `structHash`. This produces hash corresponding
     * to the one signed with the
     * https://eips.ethereum.org/EIPS/eip-712[`eth_signTypedData`]
     * JSON-RPC method as part of EIP-712.
     *
     * See {recover}.
     */
    function toTypedDataHash(bytes32 domainSeparator, bytes32 structHash) internal pure returns (bytes32) {
        return keccak256(abi.encodePacked("\x19\x01", domainSeparator, structHash));
    }
}

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

pragma solidity ^0.8.0;

import "./ECDSA.sol";

/**
 * @dev https://eips.ethereum.org/EIPS/eip-712[EIP 712] is a standard for hashing and signing of typed structured data.
 *
 * The encoding specified in the EIP is very generic, and such a generic implementation in Solidity is not feasible,
 * thus this contract does not implement the encoding itself. Protocols need to implement the type-specific encoding
 * they need in their contracts using a combination of `abi.encode` and `keccak256`.
 *
 * This contract implements the EIP 712 domain separator ({_domainSeparatorV4}) that is used as part of the encoding
 * scheme, and the final step of the encoding to obtain the message digest that is then signed via ECDSA
 * ({_hashTypedDataV4}).
 *
 * The implementation of the domain separator was designed to be as efficient as possible while still properly updating
 * the chain id to protect against replay attacks on an eventual fork of the chain.
 *
 * NOTE: This contract implements the version of the encoding known as "v4", as implemented by the JSON RPC method
 * https://docs.metamask.io/guide/signing-data.html[`eth_signTypedDataV4` in MetaMask].
 *
 * _Available since v3.4._
 */
abstract contract EIP712 {
    /* solhint-disable var-name-mixedcase */
    // Cache the domain separator as an immutable value, but also store the chain id that it corresponds to, in order to
    // invalidate the cached domain separator if the chain id changes.
    bytes32 private immutable _CACHED_DOMAIN_SEPARATOR;
    uint256 private immutable _CACHED_CHAIN_ID;
    address private immutable _CACHED_THIS;

    bytes32 private immutable _HASHED_NAME;
    bytes32 private immutable _HASHED_VERSION;
    bytes32 private immutable _TYPE_HASH;

    /* solhint-enable var-name-mixedcase */

    /**
     * @dev Initializes the domain separator and parameter caches.
     *
     * The meaning of `name` and `version` is specified in
     * https://eips.ethereum.org/EIPS/eip-712#definition-of-domainseparator[EIP 712]:
     *
     * - `name`: the user readable name of the signing domain, i.e. the name of the DApp or the protocol.
     * - `version`: the current major version of the signing domain.
     *
     * NOTE: These parameters cannot be changed except through a xref:learn::upgrading-smart-contracts.adoc[smart
     * contract upgrade].
     */
    constructor(string memory name, string memory version) {
        bytes32 hashedName = keccak256(bytes(name));
        bytes32 hashedVersion = keccak256(bytes(version));
        bytes32 typeHash = keccak256(
            "EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)"
        );
        _HASHED_NAME = hashedName;
        _HASHED_VERSION = hashedVersion;
        _CACHED_CHAIN_ID = block.chainid;
        _CACHED_DOMAIN_SEPARATOR = _buildDomainSeparator(typeHash, hashedName, hashedVersion);
        _CACHED_THIS = address(this);
        _TYPE_HASH = typeHash;
    }

    /**
     * @dev Returns the domain separator for the current chain.
     */
    function _domainSeparatorV4() internal view returns (bytes32) {
        if (address(this) == _CACHED_THIS && block.chainid == _CACHED_CHAIN_ID) {
            return _CACHED_DOMAIN_SEPARATOR;
        } else {
            return _buildDomainSeparator(_TYPE_HASH, _HASHED_NAME, _HASHED_VERSION);
        }
    }

    function _buildDomainSeparator(
        bytes32 typeHash,
        bytes32 nameHash,
        bytes32 versionHash
    ) private view returns (bytes32) {
        return keccak256(abi.encode(typeHash, nameHash, versionHash, block.chainid, address(this)));
    }

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/Counters.sol)

pragma solidity ^0.8.0;

/**
 * @title Counters
 * @author Matt Condon (@shrugs)
 * @dev Provides counters that can only be incremented, decremented or reset. This can be used e.g. to track the number
 * of elements in a mapping, issuing ERC721 ids, or counting request ids.
 *
 * Include with `using Counters for Counters.Counter;`
 */
library Counters {
    struct Counter {
        // This variable should never be directly accessed by users of the library: interactions must be restricted to
        // the library's function. As of Solidity v0.5.2, this cannot be enforced, though there is a proposal to add
        // this feature: see https://github.com/ethereum/solidity/issues/4637
        uint256 _value; // default: 0
    }

    function current(Counter storage counter) internal view returns (uint256) {
        return counter._value;
    }

    function increment(Counter storage counter) internal {
        unchecked {
            counter._value += 1;
        }
    }

    function decrement(Counter storage counter) internal {
        uint256 value = counter._value;
        require(value > 0, "Counter: decrement overflow");
        unchecked {
            counter._value = value - 1;
        }
    }

    function reset(Counter storage counter) internal {
        counter._value = 0;
    }
}

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

pragma solidity ^0.8.0;

import "./math/Math.sol";

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

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

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

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

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

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

pragma solidity ^0.8.0;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Down, // Toward negative infinity
        Up, // Toward infinity
        Zero // Toward zero
    }

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

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

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

    /**
     * @dev Returns the ceiling of the division of two numbers.
     *
     * This differs from standard division with `/` in that it rounds up instead
     * of rounding down.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b - 1) / b can overflow on addition, so we distribute.
        return a == 0 ? 0 : (a - 1) / b + 1;
    }

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

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                return prod0 / denominator;
            }

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            require(denominator > prod1);

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

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

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

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

            // Does not overflow because the denominator cannot be zero at this stage in the function.
            uint256 twos = denominator & (~denominator + 1);
            assembly {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

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

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

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

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

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works
            // in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2^8
            inverse *= 2 - denominator * inverse; // inverse mod 2^16
            inverse *= 2 - denominator * inverse; // inverse mod 2^32
            inverse *= 2 - denominator * inverse; // inverse mod 2^64
            inverse *= 2 - denominator * inverse; // inverse mod 2^128
            inverse *= 2 - denominator * inverse; // inverse mod 2^256

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

    /**
     * @notice Calculates x * y / denominator with full precision, following the selected rounding direction.
     */
    function mulDiv(
        uint256 x,
        uint256 y,
        uint256 denominator,
        Rounding rounding
    ) internal pure returns (uint256) {
        uint256 result = mulDiv(x, y, denominator);
        if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) {
            result += 1;
        }
        return result;
    }

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

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

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

    /**
     * @notice Calculates sqrt(a), following the selected rounding direction.
     */
    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = sqrt(a);
            return result + (rounding == Rounding.Up && result * result < a ? 1 : 0);
        }
    }

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

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

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

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

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

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

{
  "remappings": [
    "@beefy/contracts/=lib/beefy-contracts/contracts/BIFI/",
    "@cryptoalgebra/=lib/Algebra/src/",
    "@hyperlane-xyz/=lib/hyperlane-monorepo/solidity/",
    "@openzeppelin/contracts-upgradeable/=lib/openzeppelin-contracts-upgradeable/contracts/",
    "@openzeppelin/contracts/=lib/openzeppelin-contracts/contracts/",
    "@prb/math/=lib/prb-math/",
    "@uniswap/v3-core/=lib/v3-core/",
    "@uniswap/v3-periphery/=lib/v3-periphery/",
    "Algebra/=lib/Algebra/src/",
    "beefy-contracts/=lib/beefy-contracts/contracts/",
    "ds-test/=lib/forge-std/lib/ds-test/src/",
    "erc4626-tests/=lib/openzeppelin-contracts/lib/erc4626-tests/",
    "forge-std/=lib/forge-std/src/",
    "hyperlane-monorepo/=lib/hyperlane-monorepo/",
    "openzeppelin-contracts-upgradeable/=lib/openzeppelin-contracts-upgradeable/",
    "openzeppelin-contracts/=lib/openzeppelin-contracts/",
    "prb-math/=lib/prb-math/contracts/",
    "v3-core/=lib/v3-core/",
    "v3-periphery/=lib/v3-periphery/contracts/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "metadata": {
    "bytecodeHash": "ipfs",
    "appendCBOR": true
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "evmVersion": "paris",
  "libraries": {}
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"contract YSS","name":"stablecoin","type":"address"},{"internalType":"contract CDPModule","name":"_cdpModule","type":"address"},{"internalType":"contract PegStabilityModule","name":"_psm","type":"address"},{"internalType":"contract PSMLockup","name":"_lockup","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"PRBMathSD59x18__MulInputTooSmall","type":"error"},{"inputs":[{"internalType":"uint256","name":"rAbs","type":"uint256"}],"name":"PRBMathSD59x18__MulOverflow","type":"error"},{"inputs":[{"internalType":"uint256","name":"prod1","type":"uint256"}],"name":"PRBMath__MulDivFixedPointOverflow","type":"error"},{"inputs":[{"internalType":"uint256","name":"prod1","type":"uint256"},{"internalType":"uint256","name":"denominator","type":"uint256"}],"name":"PRBMath__MulDivOverflow","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256[]","name":"cTypeIds","type":"uint256[]"}],"name":"SetCTypeIds","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"cTypeId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"slope1","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"slope2","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"slope3","type":"uint256"},{"indexed":false,"internalType":"int256","name":"yIntercept1","type":"int256"},{"indexed":false,"internalType":"int256","name":"yIntercept2","type":"int256"},{"indexed":false,"internalType":"int256","name":"yIntercept3","type":"int256"},{"indexed":false,"internalType":"uint256","name":"utilA","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"utilB","type":"uint256"}],"name":"SetCTypeInterestParams","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"cTypeId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"interestRate","type":"uint256"}],"name":"SetInterestRate","type":"event"},{"anonymous":false,"inputs":[],"name":"SetInterestRates","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"maxInterestRate","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"minInterestRate","type":"uint256"}],"name":"SetMaxMinInterestRates","type":"event"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"cTypeIds","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"cTypeId","type":"uint256"}],"name":"cTypeInterestParams","outputs":[{"internalType":"uint256","name":"slope1","type":"uint256"},{"internalType":"uint256","name":"slope2","type":"uint256"},{"internalType":"uint256","name":"slope3","type":"uint256"},{"internalType":"int256","name":"yIntercept1","type":"int256"},{"internalType":"int256","name":"yIntercept2","type":"int256"},{"internalType":"int256","name":"yIntercept3","type":"int256"},{"internalType":"uint256","name":"utilA","type":"uint256"},{"internalType":"uint256","name":"utilB","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"components":[{"internalType":"uint256","name":"slope1","type":"uint256"},{"internalType":"uint256","name":"slope2","type":"uint256"},{"internalType":"uint256","name":"slope3","type":"uint256"},{"internalType":"int256","name":"yIntercept1","type":"int256"},{"internalType":"int256","name":"yIntercept2","type":"int256"},{"internalType":"int256","name":"yIntercept3","type":"int256"},{"internalType":"uint256","name":"utilA","type":"uint256"},{"internalType":"uint256","name":"utilB","type":"uint256"}],"internalType":"struct InterestCollateralManager.CTypeInterestParams","name":"params","type":"tuple"},{"internalType":"uint256","name":"util","type":"uint256"}],"name":"calculateInterest","outputs":[{"internalType":"uint256","name":"interestRate","type":"uint256"}],"stateMutability":"pure","type":"function"},{"inputs":[],"name":"cdpModule","outputs":[{"internalType":"contract CDPModule","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"interestRate","type":"uint256"}],"name":"denormalizeInterestRate","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"pure","type":"function"},{"inputs":[],"name":"externalDecimals","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"externalStablecoin","outputs":[{"internalType":"contract IERC20","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getUtilization","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"vaultId","type":"uint256"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"handleCollateralDeposit","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"vaultId","type":"uint256"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"handleCollateralWithdrawal","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"lockup","outputs":[{"internalType":"contract PSMLockup","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxInterestRate","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"minInterestRate","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"interestRate","type":"uint256"}],"name":"normalizeInterestRate","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"pure","type":"function"},{"inputs":[],"name":"psm","outputs":[{"internalType":"contract PegStabilityModule","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256[]","name":"_cTypeIds","type":"uint256[]"}],"name":"setCTypeIds","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"components":[{"internalType":"uint256","name":"cTypeId","type":"uint256"},{"internalType":"uint256","name":"utilA","type":"uint256"},{"internalType":"uint256","name":"utilB","type":"uint256"},{"internalType":"uint256","name":"interestRateA","type":"uint256"},{"internalType":"uint256","name":"interestRateB","type":"uint256"},{"internalType":"uint256","name":"interestRateC","type":"uint256"},{"internalType":"uint256","name":"interestRateD","type":"uint256"}],"internalType":"struct InterestCollateralManager.SetCTypeInterestParamsArgs","name":"args","type":"tuple"}],"name":"setCTypeInterestParams","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"setInterestRates","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_minInterestRate","type":"uint256"},{"internalType":"uint256","name":"_maxInterestRate","type":"uint256"}],"name":"setMinMaxInterestRates","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"stablecoin","outputs":[{"internalType":"contract YSS","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"yssDecimals","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"}]

6101206040523480156200001257600080fd5b5060405162001eea38038062001eea8339810160408190526200003591620001f7565b600080546001600160a01b0319166001600160a01b038681169190911790915583811660805282811660a081905290821660c0526040805163d9a9c6e160e01b8152905163d9a9c6e1916004808201926020929091908290030181865afa158015620000a5573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190620000cb91906200025f565b600160006101000a8154816001600160a01b0302191690836001600160a01b0316021790555060a0516001600160a01b0316637b80a6b26040518163ffffffff1660e01b8152600401602060405180830381865afa15801562000132573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019062000158919062000286565b60ff1660e08160ff168152505060a0516001600160a01b0316639dde5aa26040518163ffffffff1660e01b8152600401602060405180830381865afa158015620001a6573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190620001cc919062000286565b60ff166101005250620002ab92505050565b6001600160a01b0381168114620001f457600080fd5b50565b600080600080608085870312156200020e57600080fd5b84516200021b81620001de565b60208601519094506200022e81620001de565b60408601519093506200024181620001de565b60608601519092506200025481620001de565b939692955090935050565b6000602082840312156200027257600080fd5b81516200027f81620001de565b9392505050565b6000602082840312156200029957600080fd5b815160ff811681146200027f57600080fd5b60805160a05160c05160e05161010051611bc26200032860003960008181610309015261061d0152600081816102c0015261063e0152600081816101a60152818161066b01526106ed015260008181610141015261059e015260008181610208015281816107f70152818161121a01526112bc0152611bc26000f3fe608060405234801561001057600080fd5b50600436106101375760003560e01c806382e4b87d116100b8578063ba3fd1161161007c578063ba3fd11614610347578063cb6c211b1461035a578063d9a9c6e11461036d578063e9cbd82214610380578063eb994db114610393578063ed4eb9951461039c57600080fd5b806382e4b87d146101c85780639dd501db146102fc5780639dde5aa2146103045780639e49588a1461032b578063a9583d5f1461033e57600080fd5b80634b2fa735116100ff5780634b2fa735146101f05780634d6f91d11461020357806372af52a11461022a5780637b80a6b2146102bb5780637eb71131146102f457600080fd5b806304bda2621461013c57806305bd85361461018057806306490f47146101a15780632fd9a19d146101c85780633b3edff8146101dd575b600080fd5b6101637f000000000000000000000000000000000000000000000000000000000000000081565b6040516001600160a01b0390911681526020015b60405180910390f35b61019361018e36600461162c565b6103af565b604051908152602001610177565b6101637f000000000000000000000000000000000000000000000000000000000000000081565b6101db6101d63660046116ae565b610448565b005b6101936101eb3660046116d0565b610499565b6101db6101fe3660046116e9565b6104c1565b6101637f000000000000000000000000000000000000000000000000000000000000000081565b6102806102383660046116d0565b60056020528060005260406000206000915090508060000154908060010154908060020154908060030154908060040154908060050154908060060154908060070154905088565b604080519889526020890197909752958701949094526060860192909252608085015260a084015260c083015260e082015261010001610177565b6102e27f000000000000000000000000000000000000000000000000000000000000000081565b60405160ff9091168152602001610177565b610193610584565b6101db6107ba565b6102e27f000000000000000000000000000000000000000000000000000000000000000081565b6101936103393660046116d0565b610948565b61019360025481565b6101936103553660046116d0565b61096b565b6101db6103683660046116ae565b61098c565b600154610163906001600160a01b031681565b600054610163906001600160a01b031681565b61019360035481565b6101db6103aa366004611783565b610ac3565b6000808360c001518310156103e057606084015184516103cf9085611083565b6103d9919061181d565b9050610421565b8360e0015183101561040057608084015160208501516103cf9085611083565b60a084015160408501516104149085611083565b61041e919061181d565b90505b60008112156104335760009150610437565b8091505b61044082610948565b949350505050565b306001600160a01b0316639dd501db6040518163ffffffff1660e01b8152600401600060405180830381600087803b15801561048357600080fd5b505af1925050508015610494575060015b505050565b60006104ad670de0b6b3a764000083611845565b6104bb906305f5e100611858565b92915050565b60005460405163a7cd52cb60e01b81523360048201526001600160a01b039091169063a7cd52cb90602401602060405180830381865afa158015610509573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061052d9190611884565b61053657600080fd5b805161054990600490602084019061155b565b507ff54fad15e23bf2e29bd3913e3dc5d4b2b94333fdb3bcc6600919ab269322f6b181604051610579919061189f565b60405180910390a150565b6001546040516370a0823160e01b81526001600160a01b037f000000000000000000000000000000000000000000000000000000000000000081166004830152600092839261066292909116906370a0823190602401602060405180830381865afa1580156105f7573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061061b91906118e3565b7f00000000000000000000000000000000000000000000000000000000000000007f0000000000000000000000000000000000000000000000000000000000000000611148565b905060006107737f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316633fa4f2456040518163ffffffff1660e01b8152600401602060405180830381865afa1580156106c7573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906106eb91906118e3565b7f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03166318160ddd6040518163ffffffff1660e01b8152600401602060405180830381865afa158015610749573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061076d91906118e3565b906111b8565b90508060000361078e57670de0b6b3a76400005b9250505090565b80821061079e5760009250505090565b6107a882826111c4565b61078790670de0b6b3a7640000611845565b60006107c4610584565b905060005b60045481101561091b576000600482815481106107e8576107e86118fc565b906000526020600020015490507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031663fb092bba826040518263ffffffff1660e01b815260040161084391815260200190565b600060405180830381600087803b15801561085d57600080fd5b505af1158015610871573d6000803e3d6000fd5b50505060008281526005602081815260408084208151610100810183528154815260018201549381019390935260028101549183019190915260038101546060830152600481015460808301529182015460a0820152600682015460c0820181905260079092015460e0820152925090036108ed575050610909565b60006108f982866103af565b905061090583826111d9565b5050505b8061091381611912565b9150506107c9565b506040517f63e4353c6ddaffb535951dcd93763d51fe1c73bb503f8a332efb868233dec2e990600090a150565b6000670de0b6b3a76400006109616305f5e10084611941565b6104bb9190611963565b6004818154811061097b57600080fd5b600091825260209091200154905081565b60005460405163a7cd52cb60e01b81523360048201526001600160a01b039091169063a7cd52cb90602401602060405180830381865afa1580156109d4573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906109f89190611884565b610a0157600080fd5b81811015610a7c5760405162461bcd60e51b815260206004820152603c60248201527f496e746572657374436f6c6c61746572616c4d616e616765723a206d6178496e60448201527f74657265737452617465203c206d696e496e746572657374526174650000000060648201526084015b60405180910390fd5b6002819055600382905560408051828152602081018490527fa0677300b1bca146aaff986f674d6f03aadfd6e63d3c6febe2623f0d45cf22cc910160405180910390a15050565b60005460405163a7cd52cb60e01b81523360048201526001600160a01b039091169063a7cd52cb90602401602060405180830381865afa158015610b0b573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610b2f9190611884565b610b3857600080fd5b8060200151600010610b9a5760405162461bcd60e51b815260206004820152602560248201527f496e746572657374436f6c6c61746572616c4d616e616765723a207574696c416044820152640203d3d20360dc1b6064820152608401610a73565b8060400151816020015110610c035760405162461bcd60e51b815260206004820152602960248201527f496e746572657374436f6c6c61746572616c4d616e616765723a207574696c41604482015268101f1e903aba34b62160b91b6064820152608401610a73565b670de0b6b3a7640000816040015110610c6c5760405162461bcd60e51b815260206004820152602560248201527f496e746572657374436f6c6c61746572616c4d616e616765723a207574696c42604482015264203e3d203160d81b6064820152608401610a73565b6060810151670de0b6b3a76400001115610ccb5760405162461bcd60e51b815260206004820152602c6024820152600080516020611b6d83398151915260448201526b6573745261746541203c203160a01b6064820152608401610a73565b806080015181606001511115610d375760405162461bcd60e51b81526020600482015260386024820152600080516020611b6d83398151915260448201527f6573745261746541203e20696e746572657374526174654200000000000000006064820152608401610a73565b8060a0015181608001511115610da35760405162461bcd60e51b81526020600482015260386024820152600080516020611b6d83398151915260448201527f6573745261746542203e20696e746572657374526174654300000000000000006064820152608401610a73565b8060c001518160a001511115610e0f5760405162461bcd60e51b81526020600482015260386024820152600080516020611b6d83398151915260448201527f6573745261746543203e20696e746572657374526174654400000000000000006064820152608401610a73565b610e1c8160600151610499565b60608201526080810151610e2f90610499565b608082015260a0810151610e4290610499565b60a082015260c0810151610e5590610499565b8160c00181815250506000610e82826020015183606001518460800151610e7c9190611845565b906111c4565b90506000610eb183602001518460400151610e9d9190611845565b84608001518560a00151610e7c9190611845565b90506000610eea8460400151610ecc670de0b6b3a764000090565b610ed69190611845565b8560a001518660c00151610e7c9190611845565b6060850151602086015191925090600090610f069085906111b8565b8660800151610f159190611976565b90506000610f308760400151856111b890919063ffffffff16565b8760a00151610f3f9190611976565b90506040518061010001604052808781526020018681526020018581526020018481526020018381526020018281526020018860200151815260200188604001518152506005600089600001518152602001908152602001600020600082015181600001556020820151816001015560408201518160020155606082015181600301556080820151816004015560a0820151816005015560c0820151816006015560e082015181600701559050507f9ae9172baac539ee99ee795a76e7b7de32251fc62deb8af4e7b6895446daf76087600001518787878787878e602001518f6040015160405161107299989796959493929190988952602089019790975260408801959095526060870193909352608086019190915260a085015260c084015260e08301526101008201526101200190565b60405180910390a150505050505050565b6000600160ff1b83148061109a5750600160ff1b82145b156110b857604051630d01a11b60e21b815260040160405180910390fd5b600080600085126110c957846110ce565b846000035b9150600084126110de57836110e3565b836000035b905060006110f183836113c8565b90506001600160ff1b0381111561111e5760405163bf79e8d960e01b815260048101829052602401610a73565b600019808713908613808218600114611137578261113c565b826000035b98975050505050505050565b60008160ff168360ff160361115e5750826111b1565b8160ff168360ff16101561119257611176838361199d565b61118190600a611a9a565b61118b9085611858565b90506111b1565b61119c828461199d565b6111a790600a611a9a565b61118b9085611941565b9392505050565b60006111b183836113c8565b60006111b183670de0b6b3a76400008461148e565b6002548111156111ec57506002546111fb565b6003548110156111fb57506003545b670de0b6b3a764000081101561120f575050565b6000806000806000807f00000000000000000000000000000000000000000000000000000000000000006001600160a01b031663918b7cfe896040518263ffffffff1660e01b815260040161126691815260200190565b61018060405180830381865afa158015611284573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906112a89190611ac1565b9b509b5050505050509650965096509650507f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316630d114df589888888888d89896040518963ffffffff1660e01b81526004016113529897969594939291909788526001600160a01b0396909616602088015260408701949094526060860192909252608085015260a0840152151560c0830152151560e08201526101000190565b600060405180830381600087803b15801561136c57600080fd5b505af1158015611380573d6000803e3d6000fd5b5050604080518b8152602081018b90527fc6f9aa7337aa21aba4991afc2e32937fa6993d50184268333fc2a783000d113a935001905060405180910390a15050505050505050565b60008080600019848609848602925082811083820303915050670de0b6b3a7640000811061140c5760405163698d9a0160e11b815260048101829052602401610a73565b600080670de0b6b3a764000086880991506706f05b59d3b1ffff821190508260000361144a5780670de0b6b3a76400008504019450505050506104bb565b620400008285030493909111909103600160ee1b02919091177faccb18165bd6fe31ae1cf318dc5b51eee0e1ba569b88cd74c1773b91fac106690201905092915050565b60008080600019858709858702925082811083820303915050806000036114c8578382816114be576114be61192b565b04925050506111b1565b8381106114f257604051631dcf306360e21b81526004810182905260248101859052604401610a73565b60008486880960026001871981018816978890046003810283188082028403028082028403028082028403028082028403028082028403029081029092039091026000889003889004909101858311909403939093029303949094049190911702949350505050565b828054828255906000526020600020908101928215611596579160200282015b8281111561159657825182559160200191906001019061157b565b506115a29291506115a6565b5090565b5b808211156115a257600081556001016115a7565b634e487b7160e01b600052604160045260246000fd5b604051610100810167ffffffffffffffff811182821017156115f5576115f56115bb565b60405290565b604051601f8201601f1916810167ffffffffffffffff81118282101715611624576116246115bb565b604052919050565b60008082840361012081121561164157600080fd5b6101008082121561165157600080fd5b6116596115d1565b853581526020808701359082015260408087013590820152606080870135908201526080808701359082015260a0808701359082015260c0808701359082015260e08087013590820152969401359450505050565b600080604083850312156116c157600080fd5b50508035926020909101359150565b6000602082840312156116e257600080fd5b5035919050565b600060208083850312156116fc57600080fd5b823567ffffffffffffffff8082111561171457600080fd5b818501915085601f83011261172857600080fd5b81358181111561173a5761173a6115bb565b8060051b915061174b8483016115fb565b818152918301840191848101908884111561176557600080fd5b938501935b8385101561113c5784358252938501939085019061176a565b600060e0828403121561179557600080fd5b60405160e0810181811067ffffffffffffffff821117156117b8576117b86115bb565b8060405250823581526020830135602082015260408301356040820152606083013560608201526080830135608082015260a083013560a082015260c083013560c08201528091505092915050565b634e487b7160e01b600052601160045260246000fd5b808201828112600083128015821682158216171561183d5761183d611807565b505092915050565b818103818111156104bb576104bb611807565b80820281158282048414176104bb576104bb611807565b8051801515811461187f57600080fd5b919050565b60006020828403121561189657600080fd5b6111b18261186f565b6020808252825182820181905260009190848201906040850190845b818110156118d7578351835292840192918401916001016118bb565b50909695505050505050565b6000602082840312156118f557600080fd5b5051919050565b634e487b7160e01b600052603260045260246000fd5b60006001820161192457611924611807565b5060010190565b634e487b7160e01b600052601260045260246000fd5b60008261195e57634e487b7160e01b600052601260045260246000fd5b500490565b808201808211156104bb576104bb611807565b818103600083128015838313168383128216171561199657611996611807565b5092915050565b60ff82811682821603908111156104bb576104bb611807565b600181815b808511156119f15781600019048211156119d7576119d7611807565b808516156119e457918102915b93841c93908002906119bb565b509250929050565b600082611a08575060016104bb565b81611a15575060006104bb565b8160018114611a2b5760028114611a3557611a51565b60019150506104bb565b60ff841115611a4657611a46611807565b50506001821b6104bb565b5060208310610133831016604e8410600b8410161715611a74575081810a6104bb565b611a7e83836119b6565b8060001904821115611a9257611a92611807565b029392505050565b60006111b160ff8416836119f9565b6001600160a01b0381168114611abe57600080fd5b50565b6000806000806000806000806000806000806101808d8f031215611ae457600080fd5b8c51611aef81611aa9565b60208e0151909c50611b0081611aa9565b809b505060408d0151995060608d0151985060808d0151975060a08d0151965060c08d0151955060e08d015194506101008d015193506101208d01519250611b4b6101408e0161186f565b9150611b5a6101608e0161186f565b90509295989b509295989b509295989b56fe496e746572657374436f6c6c61746572616c4d616e616765723a20696e746572a2646970667358221220c427cae9eb38225bb858b19fa57e9680d09c001da1cda1db2f9997cee19753c564736f6c634300081200330000000000000000000000007a88b57bf741a3950e53421eaa6c1a3c89d066f90000000000000000000000001cd97ee98f3423222f7b4cddb383f2ee2907e6280000000000000000000000000e1ddf8d61f0570bf786594077cd431c727335a90000000000000000000000003296ee4fa62d0d78b1999617886e969a22653383

0x608060405234801561001057600080fd5b50600436106101375760003560e01c806382e4b87d116100b8578063ba3fd1161161007c578063ba3fd11614610347578063cb6c211b1461035a578063d9a9c6e11461036d578063e9cbd82214610380578063eb994db114610393578063ed4eb9951461039c57600080fd5b806382e4b87d146101c85780639dd501db146102fc5780639dde5aa2146103045780639e49588a1461032b578063a9583d5f1461033e57600080fd5b80634b2fa735116100ff5780634b2fa735146101f05780634d6f91d11461020357806372af52a11461022a5780637b80a6b2146102bb5780637eb71131146102f457600080fd5b806304bda2621461013c57806305bd85361461018057806306490f47146101a15780632fd9a19d146101c85780633b3edff8146101dd575b600080fd5b6101637f0000000000000000000000000e1ddf8d61f0570bf786594077cd431c727335a981565b6040516001600160a01b0390911681526020015b60405180910390f35b61019361018e36600461162c565b6103af565b604051908152602001610177565b6101637f0000000000000000000000003296ee4fa62d0d78b1999617886e969a2265338381565b6101db6101d63660046116ae565b610448565b005b6101936101eb3660046116d0565b610499565b6101db6101fe3660046116e9565b6104c1565b6101637f0000000000000000000000001cd97ee98f3423222f7b4cddb383f2ee2907e62881565b6102806102383660046116d0565b60056020528060005260406000206000915090508060000154908060010154908060020154908060030154908060040154908060050154908060060154908060070154905088565b604080519889526020890197909752958701949094526060860192909252608085015260a084015260c083015260e082015261010001610177565b6102e27f000000000000000000000000000000000000000000000000000000000000001281565b60405160ff9091168152602001610177565b610193610584565b6101db6107ba565b6102e27f000000000000000000000000000000000000000000000000000000000000000681565b6101936103393660046116d0565b610948565b61019360025481565b6101936103553660046116d0565b61096b565b6101db6103683660046116ae565b61098c565b600154610163906001600160a01b031681565b600054610163906001600160a01b031681565b61019360035481565b6101db6103aa366004611783565b610ac3565b6000808360c001518310156103e057606084015184516103cf9085611083565b6103d9919061181d565b9050610421565b8360e0015183101561040057608084015160208501516103cf9085611083565b60a084015160408501516104149085611083565b61041e919061181d565b90505b60008112156104335760009150610437565b8091505b61044082610948565b949350505050565b306001600160a01b0316639dd501db6040518163ffffffff1660e01b8152600401600060405180830381600087803b15801561048357600080fd5b505af1925050508015610494575060015b505050565b60006104ad670de0b6b3a764000083611845565b6104bb906305f5e100611858565b92915050565b60005460405163a7cd52cb60e01b81523360048201526001600160a01b039091169063a7cd52cb90602401602060405180830381865afa158015610509573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061052d9190611884565b61053657600080fd5b805161054990600490602084019061155b565b507ff54fad15e23bf2e29bd3913e3dc5d4b2b94333fdb3bcc6600919ab269322f6b181604051610579919061189f565b60405180910390a150565b6001546040516370a0823160e01b81526001600160a01b037f0000000000000000000000000e1ddf8d61f0570bf786594077cd431c727335a981166004830152600092839261066292909116906370a0823190602401602060405180830381865afa1580156105f7573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061061b91906118e3565b7f00000000000000000000000000000000000000000000000000000000000000067f0000000000000000000000000000000000000000000000000000000000000012611148565b905060006107737f0000000000000000000000003296ee4fa62d0d78b1999617886e969a226533836001600160a01b0316633fa4f2456040518163ffffffff1660e01b8152600401602060405180830381865afa1580156106c7573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906106eb91906118e3565b7f0000000000000000000000003296ee4fa62d0d78b1999617886e969a226533836001600160a01b03166318160ddd6040518163ffffffff1660e01b8152600401602060405180830381865afa158015610749573d6000803e3d6000fd5b505050506040513d601f19601f8201168201806040525081019061076d91906118e3565b906111b8565b90508060000361078e57670de0b6b3a76400005b9250505090565b80821061079e5760009250505090565b6107a882826111c4565b61078790670de0b6b3a7640000611845565b60006107c4610584565b905060005b60045481101561091b576000600482815481106107e8576107e86118fc565b906000526020600020015490507f0000000000000000000000001cd97ee98f3423222f7b4cddb383f2ee2907e6286001600160a01b031663fb092bba826040518263ffffffff1660e01b815260040161084391815260200190565b600060405180830381600087803b15801561085d57600080fd5b505af1158015610871573d6000803e3d6000fd5b50505060008281526005602081815260408084208151610100810183528154815260018201549381019390935260028101549183019190915260038101546060830152600481015460808301529182015460a0820152600682015460c0820181905260079092015460e0820152925090036108ed575050610909565b60006108f982866103af565b905061090583826111d9565b5050505b8061091381611912565b9150506107c9565b506040517f63e4353c6ddaffb535951dcd93763d51fe1c73bb503f8a332efb868233dec2e990600090a150565b6000670de0b6b3a76400006109616305f5e10084611941565b6104bb9190611963565b6004818154811061097b57600080fd5b600091825260209091200154905081565b60005460405163a7cd52cb60e01b81523360048201526001600160a01b039091169063a7cd52cb90602401602060405180830381865afa1580156109d4573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906109f89190611884565b610a0157600080fd5b81811015610a7c5760405162461bcd60e51b815260206004820152603c60248201527f496e746572657374436f6c6c61746572616c4d616e616765723a206d6178496e60448201527f74657265737452617465203c206d696e496e746572657374526174650000000060648201526084015b60405180910390fd5b6002819055600382905560408051828152602081018490527fa0677300b1bca146aaff986f674d6f03aadfd6e63d3c6febe2623f0d45cf22cc910160405180910390a15050565b60005460405163a7cd52cb60e01b81523360048201526001600160a01b039091169063a7cd52cb90602401602060405180830381865afa158015610b0b573d6000803e3d6000fd5b505050506040513d601f19601f82011682018060405250810190610b2f9190611884565b610b3857600080fd5b8060200151600010610b9a5760405162461bcd60e51b815260206004820152602560248201527f496e746572657374436f6c6c61746572616c4d616e616765723a207574696c416044820152640203d3d20360dc1b6064820152608401610a73565b8060400151816020015110610c035760405162461bcd60e51b815260206004820152602960248201527f496e746572657374436f6c6c61746572616c4d616e616765723a207574696c41604482015268101f1e903aba34b62160b91b6064820152608401610a73565b670de0b6b3a7640000816040015110610c6c5760405162461bcd60e51b815260206004820152602560248201527f496e746572657374436f6c6c61746572616c4d616e616765723a207574696c42604482015264203e3d203160d81b6064820152608401610a73565b6060810151670de0b6b3a76400001115610ccb5760405162461bcd60e51b815260206004820152602c6024820152600080516020611b6d83398151915260448201526b6573745261746541203c203160a01b6064820152608401610a73565b806080015181606001511115610d375760405162461bcd60e51b81526020600482015260386024820152600080516020611b6d83398151915260448201527f6573745261746541203e20696e746572657374526174654200000000000000006064820152608401610a73565b8060a0015181608001511115610da35760405162461bcd60e51b81526020600482015260386024820152600080516020611b6d83398151915260448201527f6573745261746542203e20696e746572657374526174654300000000000000006064820152608401610a73565b8060c001518160a001511115610e0f5760405162461bcd60e51b81526020600482015260386024820152600080516020611b6d83398151915260448201527f6573745261746543203e20696e746572657374526174654400000000000000006064820152608401610a73565b610e1c8160600151610499565b60608201526080810151610e2f90610499565b608082015260a0810151610e4290610499565b60a082015260c0810151610e5590610499565b8160c00181815250506000610e82826020015183606001518460800151610e7c9190611845565b906111c4565b90506000610eb183602001518460400151610e9d9190611845565b84608001518560a00151610e7c9190611845565b90506000610eea8460400151610ecc670de0b6b3a764000090565b610ed69190611845565b8560a001518660c00151610e7c9190611845565b6060850151602086015191925090600090610f069085906111b8565b8660800151610f159190611976565b90506000610f308760400151856111b890919063ffffffff16565b8760a00151610f3f9190611976565b90506040518061010001604052808781526020018681526020018581526020018481526020018381526020018281526020018860200151815260200188604001518152506005600089600001518152602001908152602001600020600082015181600001556020820151816001015560408201518160020155606082015181600301556080820151816004015560a0820151816005015560c0820151816006015560e082015181600701559050507f9ae9172baac539ee99ee795a76e7b7de32251fc62deb8af4e7b6895446daf76087600001518787878787878e602001518f6040015160405161107299989796959493929190988952602089019790975260408801959095526060870193909352608086019190915260a085015260c084015260e08301526101008201526101200190565b60405180910390a150505050505050565b6000600160ff1b83148061109a5750600160ff1b82145b156110b857604051630d01a11b60e21b815260040160405180910390fd5b600080600085126110c957846110ce565b846000035b9150600084126110de57836110e3565b836000035b905060006110f183836113c8565b90506001600160ff1b0381111561111e5760405163bf79e8d960e01b815260048101829052602401610a73565b600019808713908613808218600114611137578261113c565b826000035b98975050505050505050565b60008160ff168360ff160361115e5750826111b1565b8160ff168360ff16101561119257611176838361199d565b61118190600a611a9a565b61118b9085611858565b90506111b1565b61119c828461199d565b6111a790600a611a9a565b61118b9085611941565b9392505050565b60006111b183836113c8565b60006111b183670de0b6b3a76400008461148e565b6002548111156111ec57506002546111fb565b6003548110156111fb57506003545b670de0b6b3a764000081101561120f575050565b6000806000806000807f0000000000000000000000001cd97ee98f3423222f7b4cddb383f2ee2907e6286001600160a01b031663918b7cfe896040518263ffffffff1660e01b815260040161126691815260200190565b61018060405180830381865afa158015611284573d6000803e3d6000fd5b505050506040513d601f19601f820116820180604052508101906112a89190611ac1565b9b509b5050505050509650965096509650507f0000000000000000000000001cd97ee98f3423222f7b4cddb383f2ee2907e6286001600160a01b0316630d114df589888888888d89896040518963ffffffff1660e01b81526004016113529897969594939291909788526001600160a01b0396909616602088015260408701949094526060860192909252608085015260a0840152151560c0830152151560e08201526101000190565b600060405180830381600087803b15801561136c57600080fd5b505af1158015611380573d6000803e3d6000fd5b5050604080518b8152602081018b90527fc6f9aa7337aa21aba4991afc2e32937fa6993d50184268333fc2a783000d113a935001905060405180910390a15050505050505050565b60008080600019848609848602925082811083820303915050670de0b6b3a7640000811061140c5760405163698d9a0160e11b815260048101829052602401610a73565b600080670de0b6b3a764000086880991506706f05b59d3b1ffff821190508260000361144a5780670de0b6b3a76400008504019450505050506104bb565b620400008285030493909111909103600160ee1b02919091177faccb18165bd6fe31ae1cf318dc5b51eee0e1ba569b88cd74c1773b91fac106690201905092915050565b60008080600019858709858702925082811083820303915050806000036114c8578382816114be576114be61192b565b04925050506111b1565b8381106114f257604051631dcf306360e21b81526004810182905260248101859052604401610a73565b60008486880960026001871981018816978890046003810283188082028403028082028403028082028403028082028403028082028403029081029092039091026000889003889004909101858311909403939093029303949094049190911702949350505050565b828054828255906000526020600020908101928215611596579160200282015b8281111561159657825182559160200191906001019061157b565b506115a29291506115a6565b5090565b5b808211156115a257600081556001016115a7565b634e487b7160e01b600052604160045260246000fd5b604051610100810167ffffffffffffffff811182821017156115f5576115f56115bb565b60405290565b604051601f8201601f1916810167ffffffffffffffff81118282101715611624576116246115bb565b604052919050565b60008082840361012081121561164157600080fd5b6101008082121561165157600080fd5b6116596115d1565b853581526020808701359082015260408087013590820152606080870135908201526080808701359082015260a0808701359082015260c0808701359082015260e08087013590820152969401359450505050565b600080604083850312156116c157600080fd5b50508035926020909101359150565b6000602082840312156116e257600080fd5b5035919050565b600060208083850312156116fc57600080fd5b823567ffffffffffffffff8082111561171457600080fd5b818501915085601f83011261172857600080fd5b81358181111561173a5761173a6115bb565b8060051b915061174b8483016115fb565b818152918301840191848101908884111561176557600080fd5b938501935b8385101561113c5784358252938501939085019061176a565b600060e0828403121561179557600080fd5b60405160e0810181811067ffffffffffffffff821117156117b8576117b86115bb565b8060405250823581526020830135602082015260408301356040820152606083013560608201526080830135608082015260a083013560a082015260c083013560c08201528091505092915050565b634e487b7160e01b600052601160045260246000fd5b808201828112600083128015821682158216171561183d5761183d611807565b505092915050565b818103818111156104bb576104bb611807565b80820281158282048414176104bb576104bb611807565b8051801515811461187f57600080fd5b919050565b60006020828403121561189657600080fd5b6111b18261186f565b6020808252825182820181905260009190848201906040850190845b818110156118d7578351835292840192918401916001016118bb565b50909695505050505050565b6000602082840312156118f557600080fd5b5051919050565b634e487b7160e01b600052603260045260246000fd5b60006001820161192457611924611807565b5060010190565b634e487b7160e01b600052601260045260246000fd5b60008261195e57634e487b7160e01b600052601260045260246000fd5b500490565b808201808211156104bb576104bb611807565b818103600083128015838313168383128216171561199657611996611807565b5092915050565b60ff82811682821603908111156104bb576104bb611807565b600181815b808511156119f15781600019048211156119d7576119d7611807565b808516156119e457918102915b93841c93908002906119bb565b509250929050565b600082611a08575060016104bb565b81611a15575060006104bb565b8160018114611a2b5760028114611a3557611a51565b60019150506104bb565b60ff841115611a4657611a46611807565b50506001821b6104bb565b5060208310610133831016604e8410600b8410161715611a74575081810a6104bb565b611a7e83836119b6565b8060001904821115611a9257611a92611807565b029392505050565b60006111b160ff8416836119f9565b6001600160a01b0381168114611abe57600080fd5b50565b6000806000806000806000806000806000806101808d8f031215611ae457600080fd5b8c51611aef81611aa9565b60208e0151909c50611b0081611aa9565b809b505060408d0151995060608d0151985060808d0151975060a08d0151965060c08d0151955060e08d015194506101008d015193506101208d01519250611b4b6101408e0161186f565b9150611b5a6101608e0161186f565b90509295989b509295989b509295989b56fe496e746572657374436f6c6c61746572616c4d616e616765723a20696e746572a2646970667358221220c427cae9eb38225bb858b19fa57e9680d09c001da1cda1db2f9997cee19753c564736f6c63430008120033

0000000000000000000000007a88b57bf741a3950e53421eaa6c1a3c89d066f90000000000000000000000001cd97ee98f3423222f7b4cddb383f2ee2907e6280000000000000000000000000e1ddf8d61f0570bf786594077cd431c727335a90000000000000000000000003296ee4fa62d0d78b1999617886e969a22653383

-----Decoded View---------------
Arg [0] : stablecoin (address): 0x7A88B57BF741a3950E53421Eaa6C1a3c89d066f9
Arg [1] : _cdpModule (address): 0x1Cd97ee98f3423222f7B4CDdb383f2EE2907E628
Arg [2] : _psm (address): 0x0e1Ddf8D61f0570Bf786594077CD431c727335A9
Arg [3] : _lockup (address): 0x3296EE4Fa62D0D78B1999617886E969a22653383

-----Encoded View---------------
4 Constructor Arguments found :
Arg [0] : 0000000000000000000000007a88b57bf741a3950e53421eaa6c1a3c89d066f9
Arg [1] : 0000000000000000000000001cd97ee98f3423222f7b4cddb383f2ee2907e628
Arg [2] : 0000000000000000000000000e1ddf8d61f0570bf786594077cd431c727335a9
Arg [3] : 0000000000000000000000003296ee4fa62d0d78b1999617886e969a22653383