Optimal RANDAO Manipulation in Ethereum

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 of stake owned by an adversary, the maximum fraction of rounds that a strategic adversary can propose. We further implement our methodology and compute for all . For example, we conclude that an optimal strategic participant with of the stake can propose a fraction of rounds, of the stake can propose a fraction of rounds, and of the stake can propose a fraction of rounds.
View on arXivComments on this paper