# Sybil resistance

`kaal:entity:sybil-resistance`

**Status.** derived

This node is assembled mechanically from the 13 claims that carry the concept tag `sybil-resistance`. 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

13 claims across 8 works, 2018 to 2026.

**2018**

- [3125822-008](https://wulfkaal.github.io/claims/3125822-008) [mechanism/argued] -- A newcomer cannot buy reputation with money because the 50/50 staking of newly minted tokens leaves incumbent experts with complete power to decide whether the newcomer's contribution was positive; a losing applicant forfeits all reputation in the expertise.
  > The 50/50 stake guarantees a new expert cannot simply buy expertise, as the previous experts have complete power to decide whether the new expert has contributed positively to the platform.
  Craig Calcaterra, Wulf A. Kaal, Vlad Andrei, Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A (2018). SSRN: https://ssrn.com/abstract=3125822
- [3125822-012](https://wulfkaal.github.io/claims/3125822-012) [mechanism/argued] -- The platform is Sybil attack resistant because all power is weighted by reputation rather than by account: an owner of a single account holding 1000 tokens has the same or more power than an owner of 1000 accounts holding one token each.
  > The platform is Sybil attack resistant because all power in the platform is weighted by reputation. An owner of a single account with 1000 tokens has the same or more power than an owner of 1000 accounts with one token.
  Craig Calcaterra, Wulf A. Kaal, Vlad Andrei, Blockchain Infrastructure for Measuring Domain Specific Reputation in Autonomous Decentralized and A (2018). SSRN: https://ssrn.com/abstract=3125822
- [3266953-011](https://wulfkaal.github.io/claims/3266953-011) [empirical/asserted] *(failure mode)* -- Nobody has yet created a reputation engine that is genuinely resistant to Sybil attack and that cannot be corrupted regardless of the economics at stake, despite the many platforms that capture reputation.
  > Yet, nobody has created a truly Sybil-attack resistant reputation engine that cannot be corrupted, regardless of the economics at stake.
  Craig Calcaterra, Wulf A. Kaal, Gopinath Sivalingam, Reputation Protocol for the Internet of Trust - Conceptual Whitepaper (2018). SSRN: https://ssrn.com/abstract=3266953
- [3266953-034](https://wulfkaal.github.io/claims/3266953-034) [design/argued] -- Semada's voting algorithm is designed so that gaming the system is not economically feasible without contributing genuinely valuable improvements, because value is proven through the fees added to the system and every fee is subject to a fair validation pool.
  > The voting algorithm of Semada core is designed to combat that very system, so that it is not economically feasible to game the system without adding genuinely valuable improvements, as proven with the fees that are added to the system and the fair validation pool that every fee is subject to.
  Craig Calcaterra, Wulf A. Kaal, Gopinath Sivalingam, Reputation Protocol for the Internet of Trust - Conceptual Whitepaper (2018). SSRN: https://ssrn.com/abstract=3266953
- [3266953-035](https://wulfkaal.github.io/claims/3266953-035) [mechanism/argued] -- The Sockpuppet Protocol breaks the incentive for Sybil attacks because all power derives from validation pools in relation to what members stake and all fungible currency rewards are shared with the group in proportion to individual reputation.
  > All power comes from validation pools in relation to what DAO members stake, and all fungible currency rewards are shared fairly with the group in proportion to their individual reputation. The Sockpuppet Protocol thus breaks the incentives for Sybil attacks.
  Craig Calcaterra, Wulf A. Kaal, Gopinath Sivalingam, Reputation Protocol for the Internet of Trust - Conceptual Whitepaper (2018). SSRN: https://ssrn.com/abstract=3266953

**2020**

- [3652481-039](https://wulfkaal.github.io/claims/3652481-039) [mechanism/argued] -- Reputation weighted salary distribution defeats sock puppet attacks, because a member who creates ten accounts holding one reputation token each ends up in the same position as one account holding ten reputation tokens.
  > This solves the sock- puppet attack because if a DevDAO member creates 10 accounts with 1 reputation token each, it is the same as 1 account with 10 reputation tokens.
  Wulf A. Kaal, Decentralized Autonomous Organizations – Internal Governance and External Legal Design (2020). SSRN: https://ssrn.com/abstract=3652481

**2021**

- [3782203-031](https://wulfkaal.github.io/claims/3782203-031) [mechanism/argued] -- Charging admission to a DAO disincentivizes defection because the sunk cost of joining makes cheating expensive when rejoining would require paying again, a mechanism the authors identify as costly signaling that works better the more cheaters the surrounding environment contains.
  > First, we can disincentivize defection/betrayal by charging admission to the DAO. With the sunk cost of joining, it is more expensive to cheat, since then it would be expensive to rejoin even if members could be anonymous. This is described as costly signaling.
  Craig Calcaterra, Wulf A. Kaal, A Technical Perspective on Decentralization (2021). SSRN: https://ssrn.com/abstract=3782203
- [3799320-039](https://wulfkaal.github.io/claims/3799320-039) [mechanism/argued] -- Reputation weighted salary distribution solves the sockpuppet attack, because a member who creates ten accounts holding one reputation token each ends up in the same position as one account holding ten reputation tokens.
  > This solves the sockpuppet attack because if a DAO of DAOs member creates 10 accounts with 1 reputation token each, it is the same as 1 account with 10 reputation tokens.
  Wulf A. Kaal, A Decentralized Autonomous Organization (DAO) of DAOs (2021). SSRN: https://ssrn.com/abstract=3799320

**2025**

- [5225296-038](https://wulfkaal.github.io/claims/5225296-038) [design/argued] -- Neither weighted voting nor microsecond updates suffices alone; together they form a dual-layered defense because weighted voting addresses static identity proliferation while microsecond updates address dynamic behavioral exploitation.
  > Together, weighted voting and microsecond updates form a dual-layered defense, addressing both static identity proliferation and dynamic behavioral exploitation
  Wulf A. Kaal, Cryptographic Foundations and Interdisciplinary Dimensions of the Secure Proof of Stake (SPoS) Conse (2025). SSRN: https://ssrn.com/abstract=5225296

**2026**

- [6192998-031](https://wulfkaal.github.io/claims/6192998-031) [condition/argued] *(failure mode)* -- Formal mechanism design alone is insufficient for decentralized systems; the security analysis depends on honest agents also detecting citation rings, downranking colluding submissions, and applying penalties, so formal mechanisms must be combined with emergent social enforcement.
  > decentralized systems must combine formal mechanisms with emergent social enforcement.
  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-032](https://wulfkaal.github.io/claims/6192998-032) [mechanism/argued] -- Multi agent competition improves attack resistance because it creates multiple attack surfaces that must all succeed simultaneously, and citation transparency makes collusion detectable; with a fifty percent quality penalty for detected collusion the corruption cost doubles relative to the original framework.
  > This improved security stems from multi-agent competition creating multiple attack surfaces that must all succeed simultaneously, combined with citation transparency enabling collusion detection.
  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
- [6244278-039](https://wulfkaal.github.io/claims/6244278-039) [condition/argued] *(failure mode)* -- The evolutionary arc from consequence to care is not guaranteed: it depends on correct institutional design at each phase, including appropriate slashing parameters, robust Sybil resistance, calibrated reputation portability, and maintained human oversight.
  > This arc is not guaranteed. It depends on correct institutional design at each phase—appropriate slashing parameters, robust Sybil resistance, calibrated reputation portability, and maintained human oversight.
  Wulf A. Kaal, AI's Mother's Instinct Engineered Consequence Emergent Ethics and the Institutional Trajectory Toward Agentic Alignment (2026). SSRN: https://ssrn.com/abstract=6244278

## 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/sybil-resistance.md | sha256sum

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