# kaal:claim:3125827-032

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

**Type.** mechanism  **Support.** argued

**Holds when.**

- comparison against PoW chains such as bitcoin and Ethereum

**Source quote.**

> 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, page 23

**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.** economics, consensus-and-security

**Keywords.** energy-efficiency, proof-of-work, validation-pool, consensus-cost, scalability

**Related claims.**

- extended_by: https://wulfkaal.github.io/claims/3266953-017
- supported_by: https://wulfkaal.github.io/claims/5225296-006
- extended_by: https://wulfkaal.github.io/claims/3782210-036
- restates: https://wulfkaal.github.io/claims/3125822-033
- supported_by: https://wulfkaal.github.io/claims/3782198-031

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