kaal:claim:3125827-001

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.

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.

Craig Calcaterra, Wulf A. Kaal, Secure Proof of Stake Protocol (2018), 1 Overview, p. 3
https://ssrn.com/abstract=3125827 · source PDF

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

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

failuresupport: arguedfailure: fixed-protocol-gamingfamily: consensus-and-protocol-attackconsensus-and-securityregulatory-failureblockchaingovernance-design

• extended_by kaal:claim:3782217-012 The protocols governing how a particular oracle question is answered should be set by the subject matter exper...

The quote above is an exact substring of the source PDF, whose sha256 is 598d9bd95e4af7a0a35328677c6bfc069f69f2e32c30c720b3a0be98a23a40cb. Extraction method: pdf-text-layer.
Attestation record: colloquium/attestations/f85f9bdfadcec647...json
Verify the binding yourself: curl -s https://wulfkaal.github.io/claims/3125827-001.md | sha256sum