# kaal:claim:3402701-036

**Claim.** The Folk Theorems of game theory prove that no protocol, however complex or well engineered, can eliminate corruption, understood as behavior that profits a minority at the greater expense of the majority.

**Type.** failure  **Support.** argued

**Source quote.**

> Finally, we repeat the idea that the Folk Theorems of game theory prove that it is impossible to create protocols, no matter how complex or well- engineered, which can eliminate corruption

**From.** Craig Calcaterra, Wulf A. Kaal, Vadhindran K. Rao, *Stable Cryptocurrencies - First Order Principles* (2019), 3.4.4 Transcendental Values, page 28

**Cite as.** Craig Calcaterra, Wulf A. Kaal, Vadhindran K. Rao, Stable Cryptocurrencies - First Order Principles (2019). SSRN: https://ssrn.com/abstract=3402701

**Verify.** sha256 of source PDF `72ed2581b4cac2bd18a5b2640be959487a3cbc34c86ab5e5664924bcdb53c8e0` at https://raw.githubusercontent.com/wulfkaal/Academic-Papers/main/papers/pdf/Calcaterra%20et%20al.%20-%202019%20-%20Stable%20Cryptocurrencies%20-%20First%20Order%20Principles.pdf

**Failure mode.** corruption-inevitability  (family: collective-action-and-coordination-failure)

**Topics.** governance-design

**Keywords.** folk-theorems, corruption, protocol-design, governance

**Related claims.**

- restated_by: https://wulfkaal.github.io/claims/3782193-011
- extended_by: https://wulfkaal.github.io/claims/3782210-022
- restated_by: https://wulfkaal.github.io/claims/3406323-040

**Canonical form.** This markdown file is the canonical hashed representation of the claim. Its sha256 is the content hash used for attestation.