kaal:claim:3125827-026

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.

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,

Craig Calcaterra, Wulf A. Kaal, Secure Proof of Stake Protocol (2018), 5.2 Block production, p. 19
https://ssrn.com/abstract=3125827 · source PDF

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

• validation windows bounded to seconds for practical liveness

failuresupport: arguedfailure: finite-validation-window-forksfamily: consensus-and-protocol-attackconsensus-and-security

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