# kaal:claim:3125827-008

**Claim.** Given that Byzantine faults are inevitable in a distributed system, the known impossibility results force any consensus protocol to hedge: it can promise only a probability of finality and security, and that probability is inversely proportional to liveness and speed.

**Type.** condition  **Support.** evidenced

**Holds when.**

- asynchronous distributed networks
- presence of Byzantine faults

**Source quote.**

> Given the inevitable possibility of Byzantine faults in a distributed system, such results require any protocol to hedge, promising only a probability of finality and security inversely proportional to liveness and speed.

**From.** Craig Calcaterra, Wulf A. Kaal, *Secure Proof of Stake Protocol* (2018), 2.1 Hard theoretical limits, page 7

**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

**Topics.** consensus-and-security

**Keywords.** byzantine-fault-tolerance, finality, liveness, flp-impossibility, cap-theorem

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