Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Similar
• Submit Audit
• Compare

// SPDX-License-Identifier: ISC
pragma solidity ^0.8.19;

// ====================================================================
// |     ______                   _______                             |
// |    / _____________ __  __   / ____(_____  ____ _____  ________   |
// |   / /_  / ___/ __ `| |/_/  / /_  / / __ \/ __ `/ __ \/ ___/ _ \  |
// |  / __/ / /  / /_/ _>  <   / __/ / / / / / /_/ / / / / /__/  __/  |
// | /_/   /_/   \__,_/_/|_|  /_/   /_/_/ /_/\__,_/_/ /_/\___/\___/   |
// |                                                                  |
// ====================================================================
// ====================== VariableInterestRate ========================
// ====================================================================

import { Strings } from "@openzeppelin/contracts/utils/Strings.sol";
import { IRateCalculatorV2 } from "./interfaces/IRateCalculatorV2.sol";

/// @title A formula for calculating interest rates as a function of utilization and time
/// @author Frax Finance (https://github.com/FraxFinance)
/// @notice A Contract for calculating interest rates as a function of utilization and time
contract VariableInterestRate is IRateCalculatorV2 {
    using Strings for uint256;

    /// @notice The name suffix for the interest rate calculator
    string public suffix;

    // Utilization Settings
    /// @notice The minimum utilization wherein no adjustment to full utilization and vertex rates occurs
    uint256 public immutable MIN_TARGET_UTIL;
    /// @notice The maximum utilization wherein no adjustment to full utilization and vertex rates occurs
    uint256 public immutable MAX_TARGET_UTIL;
    /// @notice The utilization at which the slope increases
    uint256 public immutable VERTEX_UTILIZATION;
    /// @notice precision of utilization calculations
    uint256 public constant UTIL_PREC = 1e5; // 5 decimals

    // Interest Rate Settings (all rates are per second), 365.24 days per year
    /// @notice The minimum interest rate (per second) when utilization is 100%
    uint256 public immutable MIN_FULL_UTIL_RATE; // 18 decimals
    /// @notice The maximum interest rate (per second) when utilization is 100%
    uint256 public immutable MAX_FULL_UTIL_RATE; // 18 decimals
    /// @notice The interest rate (per second) when utilization is 0%
    uint256 public immutable ZERO_UTIL_RATE; // 18 decimals
    /// @notice The interest rate half life in seconds, determines rate of adjustments to rate curve
    uint256 public immutable RATE_HALF_LIFE; // 1 decimals
    /// @notice The percent of the delta between max and min
    uint256 public immutable VERTEX_RATE_PERCENT; // 18 decimals
    /// @notice The precision of interest rate calculations
    uint256 public constant RATE_PREC = 1e18; // 18 decimals

    error MaxUtilizationTooLow();
    error MaxFullUtilizationTooLow();
    error DivideByZero();
    error VertexUtilizationTooHigh();
    error UtilizationRateTooHigh();

    /// @param _suffix The suffix of the contract name
    /// @param _vertexUtilization The utilization at which the slope increases
    /// @param _vertexRatePercentOfDelta The percent of the delta between max and min, defines vertex rate
    /// @param _minUtil The minimum utilization wherein no adjustment to full utilization and vertex rates occurs
    /// @param _maxUtil The maximum utilization wherein no adjustment to full utilization and vertex rates occurs
    /// @param _zeroUtilizationRate The interest rate (per second) when utilization is 0%
    /// @param _minFullUtilizationRate The minimum interest rate at 100% utilization
    /// @param _maxFullUtilizationRate The maximum interest rate at 100% utilization
    /// @param _rateHalfLife The half life parameter for interest rate adjustments
    constructor(
        string memory _suffix,
        uint256 _vertexUtilization,
        uint256 _vertexRatePercentOfDelta,
        uint256 _minUtil,
        uint256 _maxUtil,
        uint256 _zeroUtilizationRate,
        uint256 _minFullUtilizationRate,
        uint256 _maxFullUtilizationRate,
        uint256 _rateHalfLife
    ) {
        if (_maxUtil <= _minUtil) {
            revert MaxUtilizationTooLow();
        }
        if (_maxFullUtilizationRate <= _minFullUtilizationRate) {
            revert MaxFullUtilizationTooLow();
        }

        if (_vertexUtilization > UTIL_PREC) {
            revert VertexUtilizationTooHigh();
        }

        if (
            _minUtil == 0 ||
            _rateHalfLife == 0 ||
            _vertexUtilization == 0 ||
            _vertexUtilization == UTIL_PREC ||
            _maxUtil == UTIL_PREC
        ) {
            revert DivideByZero();
        }

        if (_maxUtil > RATE_PREC || _maxFullUtilizationRate > RATE_PREC) {
            revert UtilizationRateTooHigh();
        }

        suffix = _suffix;
        MIN_TARGET_UTIL = _minUtil;
        MAX_TARGET_UTIL = _maxUtil;
        VERTEX_UTILIZATION = _vertexUtilization;
        ZERO_UTIL_RATE = _zeroUtilizationRate;
        MIN_FULL_UTIL_RATE = _minFullUtilizationRate;
        MAX_FULL_UTIL_RATE = _maxFullUtilizationRate;
        RATE_HALF_LIFE = _rateHalfLife;
        VERTEX_RATE_PERCENT = _vertexRatePercentOfDelta;
    }

    /// @notice The ```name``` function returns the name of the rate contract
    /// @return memory name of contract
    function name() external view returns (string memory) {
        return string(abi.encodePacked("Variable Rate V2 ", suffix));
    }

    /// @notice The ```version``` function returns the semantic version of the rate contract
    /// @dev Follows semantic versioning
    /// @return _major Major version
    /// @return _minor Minor version
    /// @return _patch Patch version
    function version() external pure returns (uint256 _major, uint256 _minor, uint256 _patch) {
        _major = 2;
        _minor = 0;
        _patch = 0;
    }

    /// @notice The ```getFullUtilizationInterest``` function calculate the new maximum interest rate, i.e. rate when utilization is 100%
    /// @dev Given in interest per second
    /// @param _deltaTime The elapsed time since last update given in seconds
    /// @param _utilization The utilization %, given with 5 decimals of precision
    /// @param _fullUtilizationInterest The interest value when utilization is 100%, given with 18 decimals of precision
    /// @return _newFullUtilizationInterest The new maximum interest rate
    function getFullUtilizationInterest(
        uint256 _deltaTime,
        uint256 _utilization,
        uint64 _fullUtilizationInterest
    ) internal view returns (uint64 _newFullUtilizationInterest) {
        if (_utilization < MIN_TARGET_UTIL) {
            // 18 decimals
            uint256 _deltaUtilization = ((MIN_TARGET_UTIL - _utilization) * 1e18) / MIN_TARGET_UTIL;
            // 36 decimals
            uint256 _decayGrowth = (RATE_HALF_LIFE * 1e36) + (_deltaUtilization * _deltaUtilization * _deltaTime);
            // 18 decimals
            _newFullUtilizationInterest = uint64((_fullUtilizationInterest * (RATE_HALF_LIFE * 1e36)) / _decayGrowth);
        } else if (_utilization > MAX_TARGET_UTIL) {
            // 18 decimals
            uint256 _deltaUtilization = ((_utilization - MAX_TARGET_UTIL) * 1e18) / (UTIL_PREC - MAX_TARGET_UTIL);
            // 36 decimals
            uint256 _decayGrowth = (RATE_HALF_LIFE * 1e36) + (_deltaUtilization * _deltaUtilization * _deltaTime);
            // 18 decimals
            _newFullUtilizationInterest = uint64((_fullUtilizationInterest * _decayGrowth) / (RATE_HALF_LIFE * 1e36));
        } else {
            _newFullUtilizationInterest = _fullUtilizationInterest;
        }
        if (_newFullUtilizationInterest > MAX_FULL_UTIL_RATE) {
            _newFullUtilizationInterest = uint64(MAX_FULL_UTIL_RATE);
        } else if (_newFullUtilizationInterest < MIN_FULL_UTIL_RATE) {
            _newFullUtilizationInterest = uint64(MIN_FULL_UTIL_RATE);
        }
    }

    /// @notice The ```getNewRate``` function calculates interest rates using two linear functions f(utilization)
    /// @param _deltaTime The elapsed time since last update, given in seconds
    /// @param _utilization The utilization %, given with 5 decimals of precision
    /// @param _oldFullUtilizationInterest The interest value when utilization is 100%, given with 18 decimals of precision
    /// @return _newRatePerSec The new interest rate, 18 decimals of precision
    /// @return _newFullUtilizationInterest The new max interest rate, 18 decimals of precision
    function getNewRate(
        uint256 _deltaTime,
        uint256 _utilization,
        uint64 _oldFullUtilizationInterest
    ) external view returns (uint64 _newRatePerSec, uint64 _newFullUtilizationInterest) {
        _newFullUtilizationInterest = getFullUtilizationInterest(_deltaTime, _utilization, _oldFullUtilizationInterest);

        // _vertexInterest is calculated as the percentage of the delta between min and max interest
        uint256 _vertexInterest = (((_newFullUtilizationInterest - ZERO_UTIL_RATE) * VERTEX_RATE_PERCENT) / RATE_PREC) +
            ZERO_UTIL_RATE;
        if (_utilization < VERTEX_UTILIZATION) {
            // For readability, the following formula is equivalent to:
            // uint256 _slope = ((_vertexInterest - ZERO_UTIL_RATE) * UTIL_PREC) / VERTEX_UTILIZATION;
            // _newRatePerSec = uint64(ZERO_UTIL_RATE + ((_utilization * _slope) / UTIL_PREC));

            // 18 decimals
            _newRatePerSec = uint64(
                ZERO_UTIL_RATE + (_utilization * (_vertexInterest - ZERO_UTIL_RATE)) / VERTEX_UTILIZATION
            );
        } else {
            // For readability, the following formula is equivalent to:
            // uint256 _slope = (((_newFullUtilizationInterest - _vertexInterest) * UTIL_PREC) / (UTIL_PREC - VERTEX_UTILIZATION));
            // _newRatePerSec = uint64(_vertexInterest + (((_utilization - VERTEX_UTILIZATION) * _slope) / UTIL_PREC));

            // 18 decimals
            _newRatePerSec = uint64(
                _vertexInterest +
                    ((_utilization - VERTEX_UTILIZATION) * (_newFullUtilizationInterest - _vertexInterest)) /
                    (UTIL_PREC - VERTEX_UTILIZATION)
            );
        }
    }
}

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

pragma solidity ^0.8.20;

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

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

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

    /**
     * @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), HEX_DIGITS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toStringSigned(int256 value) internal pure returns (string memory) {
        return string.concat(value < 0 ? "-" : "", toString(SignedMath.abs(value)));
    }

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

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

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

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

// SPDX-License-Identifier: ISC
pragma solidity ^0.8.19;

interface IRateCalculatorV2 {
    function name() external view returns (string memory);

    function version() external view returns (uint256, uint256, uint256);

    function getNewRate(
        uint256 _deltaTime,
        uint256 _utilization,
        uint64 _maxInterest
    ) external view returns (uint64 _newRatePerSec, uint64 _newMaxInterest);
}

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

pragma solidity ^0.8.20;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    /**
     * @dev Muldiv operation overflow.
     */
    error MathOverflowedMulDiv();

    enum Rounding {
        Floor, // Toward negative infinity
        Ceil, // Toward positive infinity
        Trunc, // Toward zero
        Expand // Away from zero
    }

    /**
     * @dev Returns the addition of two unsigned integers, with an overflow flag.
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            uint256 c = a + b;
            if (c < a) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with an overflow flag.
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            if (b > a) return (false, 0);
            return (true, a - b);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with an overflow flag.
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            // Gas optimization: this is cheaper than requiring 'a' not being zero, but the
            // benefit is lost if 'b' is also tested.
            // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
            if (a == 0) return (true, 0);
            uint256 c = a * b;
            if (c / a != b) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the division of two unsigned integers, with a division by zero flag.
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a / b);
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a division by zero flag.
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool, uint256) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a % b);
        }
    }

    /**
     * @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 towards infinity instead
     * of rounding towards zero.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        if (b == 0) {
            // Guarantee the same behavior as in a regular Solidity division.
            return a / b;
        }

        // (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 = x * y; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

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

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

            ///////////////////////////////////////////////
            // 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.

            uint256 twos = denominator & (0 - denominator);
            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 (unsignedRoundsUp(rounding) && 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
     * towards zero.
     *
     * 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 + (unsignedRoundsUp(rounding) && result * result < a ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * 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 + (unsignedRoundsUp(rounding) && 1 << result < value ? 1 : 0);
        }
    }

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

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

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 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 256, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log256(value);
            return result + (unsignedRoundsUp(rounding) && 1 << (result << 3) < value ? 1 : 0);
        }
    }

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

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

pragma solidity ^0.8.20;

/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @dev Returns the largest of two signed numbers.
     */
    function max(int256 a, int256 b) internal pure returns (int256) {
        return a > b ? a : b;
    }

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

    /**
     * @dev Returns the average of two signed numbers without overflow.
     * The result is rounded towards zero.
     */
    function average(int256 a, int256 b) internal pure returns (int256) {
        // Formula from the book "Hacker's Delight"
        int256 x = (a & b) + ((a ^ b) >> 1);
        return x + (int256(uint256(x) >> 255) & (a ^ b));
    }

    /**
     * @dev Returns the absolute unsigned value of a signed value.
     */
    function abs(int256 n) internal pure returns (uint256) {
        unchecked {
            // must be unchecked in order to support `n = type(int256).min`
            return uint256(n >= 0 ? n : -n);
        }
    }
}

{
  "remappings": [
    "frax-std/=node_modules/frax-standard-solidity/src/",
    "@prb/test/=node_modules/@prb/test/",
    "forge-std/=node_modules/forge-std/src/",
    "ds-test/=node_modules/ds-test/src/",
    "@openzeppelin/=node_modules/@openzeppelin/",
    "@rari-capital/=node_modules/@rari-capital/",
    "@uniswap/=node_modules/@uniswap/",
    "dev-fraxswap/=node_modules/dev-fraxswap/",
    "frax-standard-solidity/=node_modules/frax-standard-solidity/",
    "solidity-bytes-utils/=node_modules/solidity-bytes-utils/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 10000
  },
  "metadata": {
    "useLiteralContent": false,
    "bytecodeHash": "none",
    "appendCBOR": false
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "abi"
      ]
    }
  },
  "evmVersion": "paris",
  "viaIR": true,
  "libraries": {}
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"string","name":"_suffix","type":"string"},{"internalType":"uint256","name":"_vertexUtilization","type":"uint256"},{"internalType":"uint256","name":"_vertexRatePercentOfDelta","type":"uint256"},{"internalType":"uint256","name":"_minUtil","type":"uint256"},{"internalType":"uint256","name":"_maxUtil","type":"uint256"},{"internalType":"uint256","name":"_zeroUtilizationRate","type":"uint256"},{"internalType":"uint256","name":"_minFullUtilizationRate","type":"uint256"},{"internalType":"uint256","name":"_maxFullUtilizationRate","type":"uint256"},{"internalType":"uint256","name":"_rateHalfLife","type":"uint256"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"DivideByZero","type":"error"},{"inputs":[],"name":"MaxFullUtilizationTooLow","type":"error"},{"inputs":[],"name":"MaxUtilizationTooLow","type":"error"},{"inputs":[],"name":"UtilizationRateTooHigh","type":"error"},{"inputs":[],"name":"VertexUtilizationTooHigh","type":"error"},{"inputs":[],"name":"MAX_FULL_UTIL_RATE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_TARGET_UTIL","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MIN_FULL_UTIL_RATE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MIN_TARGET_UTIL","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"RATE_HALF_LIFE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"RATE_PREC","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"UTIL_PREC","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"VERTEX_RATE_PERCENT","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"VERTEX_UTILIZATION","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"ZERO_UTIL_RATE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_deltaTime","type":"uint256"},{"internalType":"uint256","name":"_utilization","type":"uint256"},{"internalType":"uint64","name":"_oldFullUtilizationInterest","type":"uint64"}],"name":"getNewRate","outputs":[{"internalType":"uint64","name":"_newRatePerSec","type":"uint64"},{"internalType":"uint64","name":"_newFullUtilizationInterest","type":"uint64"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"suffix","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"version","outputs":[{"internalType":"uint256","name":"_major","type":"uint256"},{"internalType":"uint256","name":"_minor","type":"uint256"},{"internalType":"uint256","name":"_patch","type":"uint256"}],"stateMutability":"pure","type":"function"}]

6040610180815234620003db5762000edc90813803806200002081620003e0565b938439820190610120918284820312620003db5783516001600160401b039290838111620003db57850192601f90838286011215620003db578451908082116200032457602091601f19966200007c84898785011601620003e0565b96828852848383010111620003db57908993929160005b828110620003c457505082600091880101528183015190858401519760608501519060808601519260a08701519560e060c0890151980151986101009e8f01519b85871115620003b357898b1115620003a257620186a08089116200039157861590811562000387575b81156200037d575b811562000372575b811562000367575b506200035657670de0b6b3a76400008088119081156200034b575b506200033a5780519384116200032457600054926001938481811c9116801562000319575b828210146200030357838111620002b8575b50809285116001146200024e57508394509083929160009462000242575b50501b916000199060031b1c1916176000555b60805260a05260c052865260e05285526101409182526101609283525192610ad594856200040786396080518581816101f501526105e6015260a0518581816104a501526106ff015260c05185818161036701526105ab015260e05185818161043d015261073a0152518481816102c801526108f40152518381816102fb015261067f01525182818161025e01528181610520015261077501525181818161033901526106210152f35b01519250388062000185565b9294849081166000805284600020946000905b888383106200029d575050501062000283575b505050811b0160005562000198565b015160001960f88460031b161c1916905538808062000274565b85870151885590960195948501948793509081019062000261565b60008052816000208480880160051c820192848910620002f9575b0160051c019085905b828110620002ec57505062000167565b60008155018590620002dc565b92508192620002d3565b634e487b7160e01b600052602260045260246000fd5b90607f169062000155565b634e487b7160e01b600052604160045260246000fd5b8b516369fb55ab60e11b8152600490fd5b90508b113862000130565b8b516301de42a960e41b8152600490fd5b905087143862000115565b89811491506200010d565b8915915062000105565b8e159150620000fd565b8c51631173807760e31b8152600490fd5b8b51631c3c204560e11b8152600490fd5b8b516356a3535960e11b8152600490fd5b8181018501518982018601528b9550840162000093565b600080fd5b6040519190601f01601f191682016001600160401b03811183821017620003245760405256fe60806040908082526004908136101561001757600080fd5b600091823560e01c9182624c98af146108dd5750816306fdde031461079857816317784ca41461075d57816331bf879d1461072257816340797eda146106e757816354fd4d50146106c05781636cd3cc77146106a25781638e75618c1461066757816391474c491461064457816395da99fc146106095781639c073270146105ce578163c416812514610593578163cd3181d5146101c0575063f7073c3a146100bf57600080fd5b346101bd57806003193601126101bd57815190808054906100df8261097d565b80855291602091600191828116908115610172575060011461011b575b610117868861010d828903836109d0565b5191829182610917565b0390f35b80809550527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e5635b83851061015f5750505050810160200161010d82610117386100fc565b8054868601840152938201938101610142565b6101179896508794506020935061010d9592507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0091501682840152151560051b8201019294386100fc565b80fd5b90503461058f57606060031936011261058f57803591602490813560443567ffffffffffffffff958682169182810361058b577f000000000000000000000000000000000000000000000000000000000000000090818510156104a057506102288482610a40565b670de0b6b3a764000090818102918183041490151715610475579061024c91610a8f565b6ec097ce7bc90715b34b9f10000000007f000000000000000000000000000000000000000000000000000000000000000081810293929181159185041417156104755788969594936102bf88946102b96102b387966102ae876102c498610a7c565b610a7c565b82610ac8565b92610a7c565b610a8f565b165b7f0000000000000000000000000000000000000000000000000000000000000000908281168281111561043657505016925b847f000000000000000000000000000000000000000000000000000000000000000094169561036485670de0b6b3a764000061035e610337838c610a40565b7f000000000000000000000000000000000000000000000000000000000000000090610a7c565b04610ac8565b917f0000000000000000000000000000000000000000000000000000000000000000948585106000146103c657505050916102bf6103b0926103aa866103b69796610a40565b90610a7c565b90610ac8565b16915b8351921682526020820152f35b92965092846103e5929596506103db91610a40565b6103aa8789610a40565b92620186a094850394851161040d57505050916103b0610406928694610a8f565b16916103b9565b6011907f4e487b7100000000000000000000000000000000000000000000000000000000835252fd5b90959291507f000000000000000000000000000000000000000000000000000000000000000080911061046b575b50506102f8565b1693508438610464565b868660118a7f4e487b7100000000000000000000000000000000000000000000000000000000835252fd5b9192917f0000000000000000000000000000000000000000000000000000000000000000915088908286111561057c5750506104dc8185610a40565b670de0b6b3a76400009081810291818304149015171561047557620186a0918203918211610475579061050e91610a8f565b6ec097ce7bc90715b34b9f10000000007f000000000000000000000000000000000000000000000000000000000000000081810294929181159186041417156104755788969594936102bf88946103aa61057087966102ae8761057698610a7c565b84610ac8565b166102c6565b915095949392508591506102c6565b8480fd5b5080fd5b82843461058f578160031936011261058f57602090517f00000000000000000000000000000000000000000000000000000000000000008152f35b82843461058f578160031936011261058f57602090517f00000000000000000000000000000000000000000000000000000000000000008152f35b82843461058f578160031936011261058f57602090517f00000000000000000000000000000000000000000000000000000000000000008152f35b82843461058f578160031936011261058f5760209051670de0b6b3a76400008152f35b82843461058f578160031936011261058f57602090517f00000000000000000000000000000000000000000000000000000000000000008152f35b82843461058f578160031936011261058f5760209051620186a08152f35b82843461058f578160031936011261058f5760609181519160028352816020840152820152f35b82843461058f578160031936011261058f57602090517f00000000000000000000000000000000000000000000000000000000000000008152f35b82843461058f578160031936011261058f57602090517f00000000000000000000000000000000000000000000000000000000000000008152f35b82843461058f578160031936011261058f57602090517f00000000000000000000000000000000000000000000000000000000000000008152f35b82843461058f578160031936011261058f578051906020927f5661726961626c65205261746520563220000000000000000000000000000000602084015260319080948154916107e78361097d565b926001908181169081156108925750600114610834575b610117878761010d828c037fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe081018452836109d0565b9080809394959850527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e5635b84831061087f57505050508201603101925061010d8261011786806107fe565b805487840189015291830191810161085f565b9050610117985061010d955060319350879492507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0091501682840152801515028201019486806107fe565b83903461058f578160031936011261058f576020907f00000000000000000000000000000000000000000000000000000000000000008152f35b60208082528251818301819052939260005b858110610969575050507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f8460006040809697860101520116010190565b818101830151848201604001528201610929565b90600182811c921680156109c6575b602083101461099757565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052602260045260246000fd5b91607f169161098c565b90601f7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0910116810190811067ffffffffffffffff821117610a1157604052565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b91908203918211610a4d57565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b81810292918115918404141715610a4d57565b8115610a99570490565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601260045260246000fd5b91908201809211610a4d57560000000000000000000000000000000000000000000000000000000000000120000000000000000000000000000000000000000000000000000000000001117000000000000000000000000000000000000000000000000006f05b59d3b200000000000000000000000000000000000000000000000000000000000000011b3400000000000000000000000000000000000000000000000000000000000142440000000000000000000000000000000000000000000000000000000012dd510c000000000000000000000000000000000000000000000000000000011af7bfb400000000000000000000000000000000000000000000000000000035cb191c38000000000000000000000000000000000000000000000000000000000002a300000000000000000000000000000000000000000000000000000000000000002242616d6d205b2e31352d372e33305d2032206461797320282e3732352d2e38323529000000000000000000000000000000000000000000000000000000000000

0x60806040908082526004908136101561001757600080fd5b600091823560e01c9182624c98af146108dd5750816306fdde031461079857816317784ca41461075d57816331bf879d1461072257816340797eda146106e757816354fd4d50146106c05781636cd3cc77146106a25781638e75618c1461066757816391474c491461064457816395da99fc146106095781639c073270146105ce578163c416812514610593578163cd3181d5146101c0575063f7073c3a146100bf57600080fd5b346101bd57806003193601126101bd57815190808054906100df8261097d565b80855291602091600191828116908115610172575060011461011b575b610117868861010d828903836109d0565b5191829182610917565b0390f35b80809550527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e5635b83851061015f5750505050810160200161010d82610117386100fc565b8054868601840152938201938101610142565b6101179896508794506020935061010d9592507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0091501682840152151560051b8201019294386100fc565b80fd5b90503461058f57606060031936011261058f57803591602490813560443567ffffffffffffffff958682169182810361058b577f0000000000000000000000000000000000000000000000000000000000011b3490818510156104a057506102288482610a40565b670de0b6b3a764000090818102918183041490151715610475579061024c91610a8f565b6ec097ce7bc90715b34b9f10000000007f000000000000000000000000000000000000000000000000000000000002a30081810293929181159185041417156104755788969594936102bf88946102b96102b387966102ae876102c498610a7c565b610a7c565b82610ac8565b92610a7c565b610a8f565b165b7f00000000000000000000000000000000000000000000000000000035cb191c38908281168281111561043657505016925b847f0000000000000000000000000000000000000000000000000000000012dd510c94169561036485670de0b6b3a764000061035e610337838c610a40565b7f00000000000000000000000000000000000000000000000006f05b59d3b2000090610a7c565b04610ac8565b917f0000000000000000000000000000000000000000000000000000000000011170948585106000146103c657505050916102bf6103b0926103aa866103b69796610a40565b90610a7c565b90610ac8565b16915b8351921682526020820152f35b92965092846103e5929596506103db91610a40565b6103aa8789610a40565b92620186a094850394851161040d57505050916103b0610406928694610a8f565b16916103b9565b6011907f4e487b7100000000000000000000000000000000000000000000000000000000835252fd5b90959291507f000000000000000000000000000000000000000000000000000000011af7bfb480911061046b575b50506102f8565b1693508438610464565b868660118a7f4e487b7100000000000000000000000000000000000000000000000000000000835252fd5b9192917f0000000000000000000000000000000000000000000000000000000000014244915088908286111561057c5750506104dc8185610a40565b670de0b6b3a76400009081810291818304149015171561047557620186a0918203918211610475579061050e91610a8f565b6ec097ce7bc90715b34b9f10000000007f000000000000000000000000000000000000000000000000000000000002a30081810294929181159186041417156104755788969594936102bf88946103aa61057087966102ae8761057698610a7c565b84610ac8565b166102c6565b915095949392508591506102c6565b8480fd5b5080fd5b82843461058f578160031936011261058f57602090517f00000000000000000000000000000000000000000000000000000000000111708152f35b82843461058f578160031936011261058f57602090517f0000000000000000000000000000000000000000000000000000000000011b348152f35b82843461058f578160031936011261058f57602090517f00000000000000000000000000000000000000000000000006f05b59d3b200008152f35b82843461058f578160031936011261058f5760209051670de0b6b3a76400008152f35b82843461058f578160031936011261058f57602090517f0000000000000000000000000000000000000000000000000000000012dd510c8152f35b82843461058f578160031936011261058f5760209051620186a08152f35b82843461058f578160031936011261058f5760609181519160028352816020840152820152f35b82843461058f578160031936011261058f57602090517f00000000000000000000000000000000000000000000000000000000000142448152f35b82843461058f578160031936011261058f57602090517f000000000000000000000000000000000000000000000000000000011af7bfb48152f35b82843461058f578160031936011261058f57602090517f000000000000000000000000000000000000000000000000000000000002a3008152f35b82843461058f578160031936011261058f578051906020927f5661726961626c65205261746520563220000000000000000000000000000000602084015260319080948154916107e78361097d565b926001908181169081156108925750600114610834575b610117878761010d828c037fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe081018452836109d0565b9080809394959850527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e5635b84831061087f57505050508201603101925061010d8261011786806107fe565b805487840189015291830191810161085f565b9050610117985061010d955060319350879492507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0091501682840152801515028201019486806107fe565b83903461058f578160031936011261058f576020907f00000000000000000000000000000000000000000000000000000035cb191c388152f35b60208082528251818301819052939260005b858110610969575050507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0601f8460006040809697860101520116010190565b818101830151848201604001528201610929565b90600182811c921680156109c6575b602083101461099757565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052602260045260246000fd5b91607f169161098c565b90601f7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0910116810190811067ffffffffffffffff821117610a1157604052565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b91908203918211610a4d57565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b81810292918115918404141715610a4d57565b8115610a99570490565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052601260045260246000fd5b91908201809211610a4d5756

0000000000000000000000000000000000000000000000000000000000000120000000000000000000000000000000000000000000000000000000000001117000000000000000000000000000000000000000000000000006f05b59d3b200000000000000000000000000000000000000000000000000000000000000011b3400000000000000000000000000000000000000000000000000000000000142440000000000000000000000000000000000000000000000000000000012dd510c000000000000000000000000000000000000000000000000000000011af7bfb400000000000000000000000000000000000000000000000000000035cb191c38000000000000000000000000000000000000000000000000000000000002a300000000000000000000000000000000000000000000000000000000000000002242616d6d205b2e31352d372e33305d2032206461797320282e3732352d2e38323529000000000000000000000000000000000000000000000000000000000000

-----Decoded View---------------
Arg [0] : _suffix (string): Bamm [.15-7.30] 2 days (.725-.825)
Arg [1] : _vertexUtilization (uint256): 70000
Arg [2] : _vertexRatePercentOfDelta (uint256): 500000000000000000
Arg [3] : _minUtil (uint256): 72500
Arg [4] : _maxUtil (uint256): 82500
Arg [5] : _zeroUtilizationRate (uint256): 316494092
Arg [6] : _minFullUtilizationRate (uint256): 4747411380
Arg [7] : _maxFullUtilizationRate (uint256): 231040687160
Arg [8] : _rateHalfLife (uint256): 172800

-----Encoded View---------------
12 Constructor Arguments found :
Arg [0] : 0000000000000000000000000000000000000000000000000000000000000120
Arg [1] : 0000000000000000000000000000000000000000000000000000000000011170
Arg [2] : 00000000000000000000000000000000000000000000000006f05b59d3b20000
Arg [3] : 0000000000000000000000000000000000000000000000000000000000011b34
Arg [4] : 0000000000000000000000000000000000000000000000000000000000014244
Arg [5] : 0000000000000000000000000000000000000000000000000000000012dd510c
Arg [6] : 000000000000000000000000000000000000000000000000000000011af7bfb4
Arg [7] : 00000000000000000000000000000000000000000000000000000035cb191c38
Arg [8] : 000000000000000000000000000000000000000000000000000000000002a300
Arg [9] : 0000000000000000000000000000000000000000000000000000000000000022
Arg [10] : 42616d6d205b2e31352d372e33305d2032206461797320282e3732352d2e3832
Arg [11] : 3529000000000000000000000000000000000000000000000000000000000000

1161:9107:3:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;-1:-1:-1;;;;1161:9107:3;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;;;;;;;;;;;;;;;;;;6660:15;;6645:30;;;;;;6748;;;;;:::i;:::-;6782:4;1161:9107;;;;;;;;;;;;;;;6746:59;;;;:::i;:::-;6887:4;6870:14;1161:9107;;;;6870:14;;1161:9107;;;;;;;;;;6896:37;;;;;7026:50;6896:37;;6869:78;6896:50;:37;;;;7025:67;6896:37;;:::i;:::-;:50;:::i;:::-;6869:78;;:::i;:::-;7026:50;;:::i;:::-;7025:67;:::i;:::-;1161:9107;6641:1031;7715:18;;1161:9107;;;7685:48;;;;;;1161:9107;;;7681:276;;9045:14;;1161:9107;;9015:44;9012:113;9015:44;2777:4;9014:68;9015:44;;;;:::i;:::-;9063:19;9014:68;;:::i;:::-;1161:9107;9012:113;:::i;:::-;9154:18;;9139:33;;;;9135:1125;9139:33;;;9562:32;;;;9546:49;9545:72;9562:32;;;9528:89;9562:32;;;:::i;:::-;9546:49;;:::i;9545:72::-;9528:89;;:::i;:::-;1161:9107;9135:1125;;1161:9107;;;;;;;;;;;9135:1125;10095:33;;;;;10094:85;10095:33;;;;;;;:::i;:::-;10133:45;;;;:::i;10094:85::-;1874:3;;1161:9107;;;;;;;;10093:142;;;;;10055:180;10093:142;;;;:::i;10055:180::-;1161:9107;9135:1125;;;1161:9107;;;;;;;;7681:276;7856:18;;;;;;7826:48;;;7822:135;;7681:276;;;;;7822:135;1161:9107;;-1:-1:-1;7822:135:3;;;;1161:9107;;;;;;;;;;6641:1031;7129:15;;;;;-1:-1:-1;7129:15:3;;7114:30;;;;;;7217;;;;;;:::i;:::-;7251:4;1161:9107;;;;;;;;;;;;;;;1874:3;1161:9107;;;;;;;;7215:73;;;;:::i;:::-;7370:4;7353:14;1161:9107;;;;7353:14;;1161:9107;;;;;;;;;;7379:37;;;;;7509:39;7379:37;;7352:78;7379:50;:37;;;;7508:67;7379:37;;:::i;:50::-;7352:78;;:::i;7508:67::-;1161:9107;6641:1031;;7110:562;7607:54;;;;;;;;;;6641:1031;;1161:9107;;;;;;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;1735:43;1161:9107;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;1476:40;1161:9107;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;2616:44;1161:9107;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;2777:4;1161:9107;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;2335:39;1161:9107;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;1874:3;1161:9107;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;;;5842:1;1161:9107;;;;;;;;;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;1628:40;1161:9107;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;2057:43;1161:9107;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;;2496:39;1161:9107;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;;5429:45;;;1161:9107;5429:45;;;1161:9107;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;5429:45;;;;;;;;;;;;;:::i;1161:9107::-;;;;;;;;;;;;;;;;;-1:-1:-1;;;;1161:9107:3;;;;;-1:-1:-1;5429:45:3;1161:9107;;;;;;;;;;;;;;;;;;;;;;;;;;;;;5429:45;1161:9107;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;;1161:9107:3;;;;;;2201:43;;1161:9107;;;;;;;;;;;;;;;;;;-1:-1:-1;1161:9107:3;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;:::-;;;;;;;:::o;:::-;;;;;;;;;;;;;;;;;;;;:::o