A Game-Theoretic Approach to the Study of Blockchain's Robustness
Ulysse Pavloff

TL;DR
This paper uses game theory to analyze and improve the robustness of Ethereum Proof-of-Stake blockchains, focusing on safety, liveness, and incentive mechanisms to prevent vulnerabilities and malicious behavior.
Contribution
It introduces a combined distributed systems and game-theoretic framework to evaluate Ethereum PoS robustness and identifies incentive-based vulnerabilities.
Findings
Inactivity leak mechanism affects safety and liveness balance.
Rational validator strategies can threaten protocol robustness.
Incentive design is crucial for resilient blockchain protocols.
Abstract
Blockchains have sparked global interest in recent years, gaining importance as they increasingly influence technology and finance. This thesis investigates the robustness of blockchain protocols, specifically focusing on Ethereum Proof-of-Stake. We define robustness in terms of two critical properties: Safety, which ensures that the blockchain will not have permanent conflicting blocks, and Liveness, which guarantees the continuous addition of new reliable blocks. Our research addresses the gap between traditional distributed systems approaches, which classify agents as either honest or Byzantine (i.e., malicious or faulty), and game-theoretic models that consider rational agents driven by incentives. We explore how incentives impact the robustness with both approaches. The thesis comprises three distinct analyses. First, we formalize the Ethereum PoS protocol, defining its…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Complex Systems and Time Series Analysis
