Optimal RANDAO Manipulation in Ethereum
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929520820355072 |
|---|---|
| author | Alpturer, Kaya Weinberg, S. Matthew |
| author_facet | Alpturer, Kaya Weinberg, S. Matthew |
| contents | 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 $f(α)$ of rounds that a strategic adversary can propose. We further implement our methodology and compute $f(\cdot)$ for all $α$. For example, we conclude that an optimal strategic participant with $5\%$ of the stake can propose a $5.048\%$ fraction of rounds, $10\%$ of the stake can propose a $10.19\%$ fraction of rounds, and $20\%$ of the stake can propose a $20.68\%$ fraction of rounds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_19883 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal RANDAO Manipulation in Ethereum Alpturer, Kaya Weinberg, S. Matthew Computer Science and Game Theory Cryptography and Security 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 $f(α)$ of rounds that a strategic adversary can propose. We further implement our methodology and compute $f(\cdot)$ for all $α$. For example, we conclude that an optimal strategic participant with $5\%$ of the stake can propose a $5.048\%$ fraction of rounds, $10\%$ of the stake can propose a $10.19\%$ fraction of rounds, and $20\%$ of the stake can propose a $20.68\%$ fraction of rounds. |
| title | Optimal RANDAO Manipulation in Ethereum |
| topic | Computer Science and Game Theory Cryptography and Security |
| url | https://arxiv.org/abs/2409.19883 |