# kaal:claim:3125827-026

**Claim.** Forcing validation pools to close in finite time, which practical demand for swift resolution requires, opens the possibility of network partition and of a lack of genuine consensus, and therefore of forks. Complete finality would require unbounded validation time.

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

**Holds when.**

- validation windows bounded to seconds for practical liveness

**Source quote.**

> By forcing validation pools to end in finite time, we open the possibility of network partition and lack of genuine consensus which opens the possibility of forks,

**From.** Craig Calcaterra, Wulf A. Kaal, *Secure Proof of Stake Protocol* (2018), 5.2 Block production, page 19

**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.** finite-validation-window-forks  (family: consensus-and-protocol-attack)

**Topics.** consensus-and-security

**Keywords.** finality, validation-pool, network-partition, forks, liveness-tradeoff

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