English

Optimal RANDAO Manipulation in Ethereum

Computer Science and Game Theory 2024-10-01 v1 Cryptography and Security

Abstract

It is well-known that RANDAO manipulation is possible in Ethereum if an adversary controls the proposers assigned to the last slots in an epoch. We provide a methodology to compute, for any fraction α\alpha of stake owned by an adversary, the maximum fraction f(α)f(\alpha) of rounds that a strategic adversary can propose. We further implement our methodology and compute f()f(\cdot) for all α\alpha. For example, we conclude that an optimal strategic participant with 5%5\% of the stake can propose a 5.048%5.048\% fraction of rounds, 10%10\% of the stake can propose a 10.19%10.19\% fraction of rounds, and 20%20\% of the stake can propose a 20.68%20.68\% fraction of rounds.

Cite

@article{arxiv.2409.19883,
  title  = {Optimal RANDAO Manipulation in Ethereum},
  author = {Kaya Alpturer and S. Matthew Weinberg},
  journal= {arXiv preprint arXiv:2409.19883},
  year   = {2024}
}

Comments

28 pages, 7 figures, full version of the AFT 2024 paper

R2 v1 2026-06-28T19:01:33.825Z