# kaal:claim:3782210-036

**Claim.** A meaningful reputational system with the potential for retrospective review would let a network rely on fewer nodes, since randomly selected nodes staking their reputation can do the polling work and be reviewed and punished later, which is one reason proof of stake is more efficient than proof of work.

**Type.** design  **Support.** argued

**Holds when.**

- consensus is near unanimous nearly all the time
- Byzantine behavior is detectable on later review

**Source quote.**

> But if we had a meaningful reputa- tional system with the potential for review, we could rely on fewer nodes. This mech- anism is one reason proof of stake is more efficient than proof of work.

**From.** Craig Calcaterra, Wulf A. Kaal, *The Importance of Reputation for the Evolution of Decentralization* (2021), Criticisms, page 14

**Cite as.** Craig Calcaterra, Wulf A. Kaal, The Importance of Reputation for the Evolution of Decentralization (2021). SSRN: https://ssrn.com/abstract=3782210

**Verify.** sha256 of source PDF `9cc531ab239f6266c8aeddcc8e54f4c06029c44e825444bee137bbcc0c9d0a8e` at https://raw.githubusercontent.com/wulfkaal/Academic-Papers/main/papers/pdf/Calcaterra%20and%20Kaal%20-%202021%20-%20The%20Importance%20of%20Reputation%20for%20the%20Evolution%20of%20Decentralization.pdf

**Topics.** consensus-and-security, governance-design, economics

**Keywords.** proof-of-stake, delegated-consensus, node-reduction, efficiency

**Related claims.**

- extends: https://wulfkaal.github.io/claims/3266953-017
- extends: https://wulfkaal.github.io/claims/3125827-032

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