# Slashing

`kaal:entity:slashing`

**Status.** derived

This node is assembled mechanically from the 16 claims that carry the concept tag `slashing`. It is a roster of what the corpus says under this term. It is **not** an adjudicated definition: no single statement here has been ruled canonical, and no first-appearance call has been made. Read the claims and judge for yourself.

## Every claim under this term

16 claims across 10 works, 2018 to 2026.

**2018**

- [3125827-006](https://wulfkaal.github.io/claims/3125827-006) [condition/asserted] -- Staking tokens with the potential for slashing is necessary to avoid the tragedy of the commons in a validation pool. Voting without something at risk does not produce honest evaluation of contributions.
  > The staking of tokens, with its potential for slashing, is necessary to avoid the tragedy of the commons.
  Craig Calcaterra, Wulf A. Kaal, Secure Proof of Stake Protocol (2018). SSRN: https://ssrn.com/abstract=3125827
- [3266953-019](https://wulfkaal.github.io/claims/3266953-019) [mechanism/asserted] -- Under the Anchor Protocol, staking means anchoring reputation to a block, so a block producer whose block turns out to be invalid or is cancelled out suffers depreciation of their reputation.
  > Moreover, staking in the Anchor Protocol means anchoring your reputation to a block. In other words, Semada block producers anchor their reputation to a block, and if the block is invalid or cancelled out, their reputation depreciates.
  Craig Calcaterra, Wulf A. Kaal, Gopinath Sivalingam, Reputation Protocol for the Internet of Trust - Conceptual Whitepaper (2018). SSRN: https://ssrn.com/abstract=3266953
- [3266953-026](https://wulfkaal.github.io/claims/3266953-026) [mechanism/asserted] -- Producing a bad block is punished by slashing, since the producer loses the availability stakes they posted to be considered in the random selection of block producers.
  > Producing bad blocks is slashed because the bad block producer will lose their availability stakes (the tokens the producer staked to be considered for the random selection of block producers) in the validation pool.
  Craig Calcaterra, Wulf A. Kaal, Gopinath Sivalingam, Reputation Protocol for the Internet of Trust - Conceptual Whitepaper (2018). SSRN: https://ssrn.com/abstract=3266953

**2021**

- [3782203-034](https://wulfkaal.github.io/claims/3782203-034) [mechanism/argued] -- The deterrent power of reputation tokens grows with network size, because the loss of opportunity from having reputation slashed increases as the network gets larger.
  > Another advantage to digital tokens in open global networks is that the loss of opportunity from having your reputation slashed grows as the size of the network in- creases.
  Craig Calcaterra, Wulf A. Kaal, A Technical Perspective on Decentralization (2021). SSRN: https://ssrn.com/abstract=3782203
- [3799320-036](https://wulfkaal.github.io/claims/3799320-036) [mechanism/argued] -- The opportunity loss from having reputation slashed grows as the network grows, because a larger network means more competition for the reputation tokens that determine fungible salary shares.
  > In the DAO of DAOs design the loss of opportunity from slashing DAO of DAOs member reputation grows as the size of the network increases. In other words, the larger the DAO of DAOs network, the more competition for reputation tokens to receive fungible token salaries.
  Wulf A. Kaal, A Decentralized Autonomous Organization (DAO) of DAOs (2021). SSRN: https://ssrn.com/abstract=3799320
- [3981021-033](https://wulfkaal.github.io/claims/3981021-033) [mechanism/argued] -- The loss of opportunity from slashing a voting associate's reputation grows as the size of the network increases, because a larger network intensifies competition among associates for the reputation tokens that determine fungible salary payouts.
  > reputation tokens to receive fungible token salaries that are paid in proportion to reputation tokens. Accordingly, in the CHARITYxDAO design, the loss of opportunity from slashing CHARITYxDAO VA reputation grows as the size of the network increases.
  Wulf A. Kaal, How Decentralized Autonomous Organizations Optimize Charitable Giving (2021). SSRN: https://ssrn.com/abstract=3981021
- [3981021-035](https://wulfkaal.github.io/claims/3981021-035) [mechanism/argued] -- Punishment for nefarious conduct becomes credible when it is automated, and the value of a voting associate's reputation is directly related to how well punishment can be distributed in response to nefarious conduct.
  > - Punishment for nefarious conduct becomes automated and therefore credible. The CHARITYxDAO reputation staking design also enhances policing and compliance. The value of CHARITYxDAO VA reputation is directly related to how well punishment can be distributed in
  Wulf A. Kaal, How Decentralized Autonomous Organizations Optimize Charitable Giving (2021). SSRN: https://ssrn.com/abstract=3981021
- [3995709-030](https://wulfkaal.github.io/claims/3995709-030) [mechanism/argued] -- Crowd review and policing votes by the CRDAO collective filter out idiosyncratic reviewer preferences, because reviewers who submit highly idiosyncratic reviews would have to fear slashing and loss of standing in the community.
  > Instead, the CRDAO mandates that reviews are subject to crowd review and policing votes by the CRDAO collective. Accordingly, code reviewers are less likely to engage in highly idiosyncratic reviews as they would need to fear slashing and loss of standing in the community.
  Wulf A. Kaal, How DAOs Optimize Open-Source Code Reviews and Create Open-Source Standards (2021). SSRN: https://ssrn.com/abstract=3995709

**2024**

- [4734750-024](https://wulfkaal.github.io/claims/4734750-024) [mechanism/argued] -- Subjecting every review to crowd review and policing votes makes reviewers less likely to produce idiosyncratic reviews, because they would face slashing and loss of standing in the community.
  > Accordingly, code reviewers are less likely to engage in highly idiosyncratic reviews as they would need to fear slashing and loss of standing in the community.
  Wulf A. Kaal, Code Review DAO (2024). SSRN: https://ssrn.com/abstract=4734750

**2025**

- [5225296-021](https://wulfkaal.github.io/claims/5225296-021) [mechanism/evidenced] -- Slashing establishes a Nash equilibrium in which rational validators adhere to honest behavior, because the expected cost of penalties exceeds any short-term gain available from misconduct.
  > game-theoretic models, which demonstrate that slashing establishes a Nash equilibrium wherein rational validators are incentivized to adhere to honest behavior, as the expected cost of penalties outweighs any potential short-term gains from misconduct
  Wulf A. Kaal, Cryptographic Foundations and Interdisciplinary Dimensions of the Secure Proof of Stake (SPoS) Conse (2025). SSRN: https://ssrn.com/abstract=5225296
- [5225296-022](https://wulfkaal.github.io/claims/5225296-022) [design/argued] -- SPoS imposes a dual penalty that reduces financial stake and reputation at the same time, amplifying accountability by combining immediate tangible cost with long-term social consequence inside the validator community.
  > When combined with slashing, which simultaneously reduces both financial stake and reputation—a dual penalty unique to SPoS—this mechanism amplifies accountability by imposing immediate tangible costs and long-term social consequences within the validator community
  Wulf A. Kaal, Cryptographic Foundations and Interdisciplinary Dimensions of the Secure Proof of Stake (SPoS) Conse (2025). SSRN: https://ssrn.com/abstract=5225296
- [5887242-010](https://wulfkaal.github.io/claims/5887242-010) [mechanism/argued] -- In the UDLC DAO, REP holders stake non-fungible reputation on predicted outcomes in Validation Pools; correct predictions mint fractional REP and integrate the new vertex with its weighted citation edges into the canonical Codex, while incorrect predictions trigger partial slashing and redistribution.
  > REP token holders stake their non-fungible reputation on predicted outcomes in Validation Pools. Correct predictions mint fractional REP and integrate the new vertex and its weighted citation edges into the canonical Codex. Incorrect predictions result in partial slashing and redistribution.
  Wulf A. Kaal, The UDLC DAO Operationalizing a Continuously Evolving Universal Digital Law Codex Through Weighted (2025). SSRN: https://ssrn.com/abstract=5887242
- [5887242-019](https://wulfkaal.github.io/claims/5887242-019) [mechanism/argued] -- The tight coupling of minority stakes, under which all reputation staked on the losing outcome is slashed in its entirety by burning or redistribution, is the source of the mechanism's incorruptibility.
  > The key innovation, and the source of the mechanism's incorruptibility, is the "tight coupling" of minority stakes. Here, all reputation staked on the losing outcome is slashed (burned or redistributed) in its entirety.
  Wulf A. Kaal, The UDLC DAO Operationalizing a Continuously Evolving Universal Digital Law Codex Through Weighted (2025). SSRN: https://ssrn.com/abstract=5887242
- [5887242-023](https://wulfkaal.github.io/claims/5887242-023) [empirical/evidenced] -- In the worked numerical example, a single incorrect high-conviction bet costs the dissenting expert seventy five percent of his governance influence, demonstrating the severity of tight coupling.
  > David loses 75% of his influence in a single incorrect high-conviction bet
  Wulf A. Kaal, The UDLC DAO Operationalizing a Continuously Evolving Universal Digital Law Codex Through Weighted (2025). SSRN: https://ssrn.com/abstract=5887242

**2026**

- [6192998-028](https://wulfkaal.github.io/claims/6192998-028) [mechanism/argued] -- Reallocating staked reputation according to performance relative to the average creates competitive pressure, since an agent must beat the average to gain reputation; this converts the original winner takes all binary mechanism into a proportional system rewarding degrees of excellence.
  > This creates competitive pressure: agents must perform better than average to gain reputation. Thus, extending the winner-takes-all mechanism from the original binary framework to a proportional system that rewards degrees of excellence.
  Wulf A. Kaal, Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution (2026). SSRN: https://ssrn.com/abstract=6192998
- [6192998-039](https://wulfkaal.github.io/claims/6192998-039) [mechanism/argued] -- Because AI agents can generate unlimited Sybil identities at near zero cost, defense must come from multi agent validation with quality based slashing, which imposes economic penalties scaling with the sophistication needed to produce competitive quality output.
  > Adversarial robustness: AI agents can generate unlimited Sybil identities at near-zero cost. Multi-agent validation with quality-based slashing creates economic penalties that scale with the sophistication required to produce competitive-quality outputs.
  Wulf A. Kaal, Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution (2026). SSRN: https://ssrn.com/abstract=6192998

## Verify

Every claim above resolves to a record carrying a verbatim source quote, the sha256 of the source PDF, and a preformatted citation. Nothing here asks to be taken on trust.

    curl -s https://wulfkaal.github.io/entities/slashing.md | sha256sum

**Canonical form.** This markdown file is the canonical hashed representation of this entity node. Its sha256 is the content hash.