# kaal:claim:3125827-001

**Claim.** No single, fixed, entirely algorithmic policing solution can completely prevent independent nodes in a distributed system from gaming block production to advantage some parties over others. Any consensus protocol that relies on a permanently fixed rule set will therefore be gamed as conditions change.

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

**Holds when.**

- distributed systems with independent, self interested nodes
- protocols that are fixed rather than continually revisable

**Source quote.**

> In fact it is obvious there can be no single, fixed, entirely algorithmic policing solution which completely prevents independent nodes in a distributed system from gaming the system by producing blocks with transactions that advantage some parties over others1.

**From.** Craig Calcaterra, Wulf A. Kaal, *Secure Proof of Stake Protocol* (2018), 1 Overview, page 3

**Cite as.** Craig Calcaterra, Wulf A. Kaal, Secure Proof of Stake Protocol (2018). SSRN: https://ssrn.com/abstract=3125827

**Verify.** sha256 of source PDF `598d9bd95e4af7a0a35328677c6bfc069f69f2e32c30c720b3a0be98a23a40cb` at https://raw.githubusercontent.com/wulfkaal/Academic-Papers/main/papers/pdf/Calcaterra%20and%20Kaal%20-%202018%20-%20Secure%20Proof%20of%20Stake%20Protocol.pdf

**Failure mode.** fixed-protocol-gaming  (family: consensus-and-protocol-attack)

**Topics.** consensus-and-security, regulatory-failure, blockchain, governance-design

**Keywords.** consensus-protocols, protocol-gaming, impossibility-results, proof-of-stake, blockchain-governance

**Related claims.**

- extended_by: https://wulfkaal.github.io/claims/3782217-012

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