# kaal:claim:6192998-009

**Claim.** Under the 2018 validation pool design, the cost of corrupting the system to reach fifty one percent control is at minimum twice the total reputation value of the system.

**Type.** empirical  **Support.** evidenced

**Holds when.**

- attacker acquires reputation through repeated fee payments
- attacker always wins the validation pool, the worst case

**Source quote.**

> This is the fundamental security bound: corrupting the system costs at minimum 2× the total reputation value.34

**From.** Wulf A. Kaal, *Evolution of Domain-Specific Reputation Systems From Binary Validation to Citation-Weighted Knowledge Attribution* (2026), II.C. Security Properties: Attack Resistance Mathematics, page 15

**Cite as.** 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.** sha256 of source PDF `b04292561ee041e0c9eaa7eca28a410ed440e76a95743a539361a3f76c97f2b3` at https://raw.githubusercontent.com/wulfkaal/Academic-Papers/main/papers/pdf/Kaal%20-%202026%20-%20Evolution%20of%20Domain-Specific%20Reputation%20Systems%20From%20Binary%20Validation%20to%20Citation-Weighted%20Knowledge%20Attribution.pdf

**Topics.** consensus-and-security, reputation, economics

**Keywords.** attack-resistance, corruption-cost, security-bound, 51-percent-attack, reputation-economics

**Related claims.**

- supports: https://wulfkaal.github.io/claims/3128900-019
- supports: https://wulfkaal.github.io/claims/3125822-016

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