Paper: arXiv 2408.00928

Authors: Tarun Chitra, Mallesh Pai

Abstract

Restaking protocols have aggregated billions of dollars of security by utilizing token incentives and payments. A natural question to ask is: How much security do restaked services \emph{really} need to purchase? To answer this question, we expand a model of Durvasula and Roughgarden [DR24] that includes incentives and an expanded threat model consisting of strategic attackers and users. Our model shows that an adversary with a strictly submodular profit combined with strategic node operators who respond to incentives can avoid the large-scale cascading failures of~[DR24]. We utilize our model to construct an approximation algorithm for choosing token-based incentives that achieve a given security level against adversaries who are bounded in the number of services they can simultaneously attack. Our results suggest that incentivized restaking protocols can be secure with proper incentive management.

Complexity vs Empirical Score

  • Math Complexity: 8.0/10
  • Empirical Rigor: 2.5/10
  • Quadrant: Lab Rats — theoretically deep, empirically untested

Why this score: The paper provides a rigorous mathematical expansion of the Durvasula-Roughgarden model for restaking security using submodular adversaries and strategic operator incentives. While it offers solid algorithmic bounds and theoretical proofs, it lacks empirical validation or backtesting on real-world restaking network data.

Research Flowchart

  flowchart TD
    A["Research Question: How much security do restaked services really need to purchase?"] --> B["Expand DR24 Model: Add strategic actors & submodular adversary profit"]
    
    C["Inputs: Token incentives, node operator costs, adversary attack bounds"] --> D["Game-Theoretic Simulation & Threat Analysis"]
    B --> D
    
    D --> E["Construct Approximation Algorithm for Incentive Optimization"]
    
    E --> F["Outcomes: Avoid cascading failures & secure restaking with proper incentive management"]

Cited References (51)

  1. A constructive proof of the general Lov 'a sz local lemma (2010)
  2. Problems and results on 3-chromatic hypergraphs and some related questions (1975)
  3. Calibrated learning and correlated equilibrium (1997)
  4. Forecast hedging and calibration (2021)
  5. “Calibeating”: Beating forecasters at their own game (2023)
  6. Online minimax multiobjective optimization: Multicalibeating and other applications (2022)
  7. Moment multicalibration for uncertainty estimation (2021)
  8. Online multivalid learning: Means, moments, and prediction intervals (2021) — link
and 43 more
  1. Faster recalibration of an online predictor via approachability (2024)
  2. Faster game solving via predictive blackwell approachability: Connecting regret matching and mirror descent (2021)
  3. Blackwell approachability and no-regret learning are equivalent (2011)
  4. Stackelberg security games: Looking beyond a decade of success (2018)
  5. Commitment without regrets: Online learning in stackelberg security games (2015)
  6. Learning in stackelberg games with non-myopic agents (2022)
  7. Restaking — DeFi Llama (2024) — link
  8. u–1 : Eigenlayer Directory (2024) — link
  9. Improving proof of stake economic security via MEV redistribution (2022)
  10. Why stake when you can borrow? (2020) — link
  11. Flash boys 2.0: Frontrunning in decentralized exchanges, miner extractable value, and consensus instability (2020)
  12. The Risks of LRTs (2024) — link
  13. EigenLayer Rewards Calculation (2024) — link
  14. Twap oracle attacks: Easier done than said? (2022)
  15. An Analysis of Intent-Based Markets (2024) — link
  16. Optimal approximation for submodular and supermodular optimization with bounded curvature (2017)
  17. Collusion-resilience in transaction fee mechanism design (2024) — link
  18. Speculative Denial-of-Service Attacks in Ethereum. (2023)
  19. Blockchain stretching & squeezing: Manipulating time for your best interest (2022)
  20. Oracles in decentralized finance: Attack costs, profits and mitigation measures (2022)
  21. Symbiotic Vault Reward (2024) — link
  22. EigenLayer & LRT Points (2024) — link
  23. Optimizing AVS Allocations for Liquid Restaking Tokens (LRTs) (2024) — link
  24. Liquid Restaking Token (LRT) Market Risk Framework (2024) — link
  25. EigenLayer: The Restaking Collective (2023) — link
  26. Routing MEV in Constant Function Market Makers (2023)
  27. EIGEN: The Universal Intersubjective Work Token (2024) — link
  28. Robust Restaking Networks (2024) — link
  29. Intrinsic robustness of the price of anarchy (2015)
  30. Maximizing sequence-submodular functions and its application to online advertising (2021)
  31. The adaptive complexity of maximizing a submodular function (2018)
  32. Submodular norms with applications to online facility location and stochastic probing (2023) — link
  33. String submodular functions with curvature constraints (2015)
  34. Compounding of wealth in proof-of-stake cryptocurrencies (2019)
  35. The principal–agent problem in liquid staking (2023)
  36. Polyhedral clinching auctions and the adwords polytope (2015)
  37. An axiomatic approach to block rewards (2019)
  38. Concave pro-rata games (2023)
  39. Convex optimization (2004)
  40. On an inequality of Gronwall (2001)
  41. An efficient ascending-bid auction for multiple objects (2004)
  42. An efficient dynamic auction for heterogeneous commodities (2006)
  43. Multi-item vickrey–dutch auctions (2009)

0 of 51 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2518 linked papers.