The second part of this article is about the StableSwap invariant.

CryptoSwap

The CryptoSwap invariant is a core mathematical formula that defines the "liquidity curve" for Curve's trading pools, specifically designed for highly volatile asset pairs (not tightly pegged like stablecoins). It helps the pool concentrate liquidity around an "internal" price (determined through an internal oracle) and automatically adjusts when the pool becomes imbalanced. Here are the key points:

Combining advantages of two invariants:

• When the pool is balanced (value-equivalent balances), the CryptoSwap invariant behaves similarly to the stableswap invariant, creating a "flat" region (no slippage) that enables near 1:1 exchanges.

• When the pool becomes imbalanced, the invariant gradually shifts to constant-product invariant behavior (like Uniswap), resulting in increased slippage and protecting the pool against excessive price deviations.

In Part 1, the StableSwap Invariant is described in the general formula:

And the CryptoSwap invariant is encouraged by the StableSwap invariant:

however, K is defined slightly differently:

• A (amplification coefficient): The A parameter, similar to StableSwap invariant (Curve v1), controls how flat the bonding curve is at its center. This determines how concentrated liquidity is around the expected exchange rate (i.e., the "price scale"; see below)

• Gamma: The gamma parameter controls the separation between the two constant product curves shown in the above figure (dashed lines). When gamma increases, it stretches the "adjusted constant product" curve toward the lower-left corner, moving the curve's asymptotes closer to the axes and broadening the overall curve shape
  

The init:

With the initial formula, we can rewrite f(D_0) as in a situation which only has 2 coins:

Using Newton's method, the Initial values can be transformed to:

With this formula, D_0 can be calculated by looping through A time. In the viper code, A is set to 255.

The code calculates the absolute difference between the current and previous values of D_0. It stops iterating when the difference is either very small (diff ≤ 1) or when the difference multiplied by 10^18 is less than D_0. Once one of these conditions is met, the function returns the converged value of D_0.

Back to the invariant, let S be the sum of x_i and P is the product of x_i. f(D) with 2 coins (N = 2) becomes:

The derivative of f(D) is:

This can be transformed to:

The above formula can be transformed to simplify. First, divide all terms by K and expand everything inside the parentheses.

Now S can be written as - S + 2S:

Then, factor out the common terms between the groups containing S and D.

Make all denominators inside the parentheses common:

Introduce two auxiliary variables, mul1 and mul2, to simplify the variables in the function:

The derivative f'(D) now can be reduced to:

In the viper code, _g1k0 variable is defined to be:

Back into the code,

This code calculates -f'(D) instead of f'(D). This makes Newton's step more clear. In addition, f(D) is divided by K:

The full Newton's method for D now is:

The formula has been separated into two parts for Newton's method:

The final D will be calculated as the difference between the two equations above.