kaal:claim:3125827-032

SPoS is far more computationally efficient than proof of work implementations because nodes no longer hash mine; the only computation added beyond the block validity checking every blockchain performs is one validation pool per block, in which each node sends a single up or down vote transaction.

Source quote, verbatim
Nodes will no longer hash mine. They will check the validity of the blocks, but they do that under any blockchain. The only added computation is the validation pool which happens once for each block, where nodes send one transaction, an up- or downvote.
From

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

Cite as

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

Holds when
Classification

mechanismsupport: arguedeconomicsconsensus-and-security

Related claims
Verify

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