AVS Selection Framework - Gauntlet

Authors

Walter Li and Carson Brown
February 29, 2024
Research

AVS Selection Framework

Key Takeaways

Contents

  1. On AVS selection
  2. On additional considerations for selection
  3. On including new AVS
  4. Conclusions

Given AVS development is still in progress and the transient status of slashing rules and fee generation, we aim to provide a high level framework on how to approach Eigenlayer staking, with focus on how to select AVS to secure. We examine yield generation and how that flows from transaction fees at the AVS level to how that accrues at the LRT level. The below diagram is a simplified representation of how ETH may flow from the LRT minter to operators and AVS, abstracting away some of the engineering and contract specifications. We will focus on the RHS of the below diagram.

On AVS selection

A general approach with n different AVS should be to optimize the risk adjusted total returns of the fee generation less the expected slashing, over some future time period. Given AVS yield over time likely varies, this future time period can be broken up into distinct subperiods, where at the end of each we perform the optimization and rebalance our AVS selection. That being said, optimizing for risk adjusted return (i.e. Sharpe) may yield insufficient reward than optimizing for total return at each time step.

For simplicity, we consider optimization over a constant window of 2 weeks (double the AVS withdrawal period). This allows comparison between the yield resulting from current AVS selection compared to our future AVS selection after rebalancing. A more nuanced window can take into account LRT idiosyncratic creation and redemption times.

More formally, we wish to perform the following optimization with the following constraints at each rebalancing time t. Let AVS correspond to the set of all AVS live and O correspond to the operators associated with the LRT.

max AVS g(∑o∈O∑a∈AVSwff(ca,o,t)−wss(ca,o,t))
subject to
ca,o < DREo ∑a∈AVS ca,o < L(DREo) for each a∈AVS,o∈O

g is a utility function on the difference between the fee generation f and slashing s. We provide more color on how g may behave based on different risk preferences in the section below.
DREo represents the portfolio of D elegated R estaked E TH to the operator o, composed of delegated LST and delegated staked beacon chain ETH.
ca corresponds to how much each underlying in operator o’s restake portfolio DREo we choose to delegate to AVS a.
L(DREo) corresponds to a global leverage limit on the underlying restaked ETH portfolio for each operator.

Put together, the above seeks to optimize the total expected fee generation less the expected slashing over some future time period, conditioned on

As an explicit example for the LRT’s more risk averse preference towards yield accrual, the LRT could consider the following representations for the utility function g.

Put together, one example of the objective function for the LRT for AVS selection could take the form:
E[∑o∈O∑a∈AVS log f(ca,o,t)−2s(ca,o,t) | F]
where F is the filtration of past realizations for f and s.

On additional considerations for selection

Considerations for each AVS

Based on the LRT’s risk preference, there can exist additional considerations at the AVS level that adjust the above optimization. These bounds aim to limit the downsides associated with a particular choice of AVS, or enforce a baseline level of profitability, due to variation in AVS slashing conditions.

Each AVS has a slashing penalty that is bounded from above.

P(∑o∈Of(ca,o,t)−s(ca,o,t)≤cslash | Oa) < δ where Oa is all the operators’ stake for AVS a,cslash is a lower bound on tolerable AVS payout over our designated time period.

Each AVS has payout that is positive in expectation in isolation.

E[∑o∈Of(ca,o,t)−s(ca,o,t)] ≥ cmin > 0 where cmin corresponds to a minimum expectation of AVS payout.

Pairwise AVS slashing correlations are upper bounded.

Corr(s(cai,o,tk),s(caj,o,tk) | k ≥ tstart) < ccorrelation across all operators o and AVS pairs i,j

Considerations for iterative performance

Performance in previous windows may give information on how future optimization could be improved, such as making constraints tighter (i.e. more limiting parameters) if previous AVS selection has been more punitive than expected, or perhaps adding additional filtering for future AVS selection. Ultimately, the LRT consistently and stabling accruing yield will be an important factor in driving usage.

Iterative rolling Sharpe ratio maintains above a threshold.

Sharpe(tsharpe,∑o∈O∑o∈AVSf(ca,o,t)−s(ca,o,t)) ≥ csharpe where csharpe is the rolling window where risk-adjusted returns are calculated, and csharpe is our minimum Sharpe benchmark.

On including new AVS

Upon EigenDA launch, it will likely be the only AVS live. Assuming objective attributable slashing conditions, the naive approach of concentrating 100% of operator stake on securing EigenDA is likely optimal. In the event that slashing conditions involve degrees of subjectivity, penalties are excessive, or EigenDA transaction volume and associated fee generation and subsidies insufficient, then it could make sense to not secure EigenDA at all. This is the singular case with one AVS; as more AVS launch and go live, considerations regarding inter-AVS impacts on yield generation begin to appear.

As a result, finding stake sizing for new AVS involves speculation on the net yield generation for the new AVS and its slashing conditions. Proxying the yield generation for new AVS informs a baseline sizing, while the slashing conditions offer adjustments to that baseline sizing.

Estimates for yield generation from the new AVS can be derived from a combination of previous AVS launch yields, L1 yields.
How to factor in sizing adjustments up or down due to slashing conditions depends on the new AVS slashing construction.

Conclusions

We lay out a mathematical framework above on how to approach AVS selection. Fundamentally, allocations among different AVS is rooted in our estimation for net yields and slashing from those AVS, with global constraints from Eigenlayer mechanisms. Based on risk aversion, we may also impose a number of conditions that filter AVS on a more granular level. The lack of formalized information regarding AVS slashing conditions can make it difficult to generate specific recommendations on stake allocation among different AVS. Nonetheless, we seek to find generalized principles around AVS allocation that can remain robust.

There is a quite natural question that follows - how do we capture the inherently developing nature of restaking? This dynamism and relationship between restakers, the marketplace, and the AVS’s - and how they interact with natural market variance and shocks - suggest that careful agent-based simulation can find that intricate balance between restaking yield and AVS slashing penalties, and ultimately drive greater capital efficiency.