Sybil Resistance

A Sybil defense mechanism that requires the expenditure of a scarce, verifiable external resource—typically computational power—to create a new identity or cast a vote. The economic cost of solving a cryptographic puzzle makes it financially prohibitive for an attacker to generate a large number of pseudonymous nodes. Bitcoin pioneered this approach, where the probability of a node producing a block is proportional to its hashrate, not its number of identities.

• Key property: One-CPU-one-vote, not one-IP-one-vote
• Attack cost: Attacker must acquire and power hardware exceeding 51% of network hashrate
• Limitation: Does not prevent a wealthy adversary from purchasing sufficient hardware; also faces criticism for energy consumption

A consensus and Sybil resistance mechanism where the weight of a validator's vote is proportional to the amount of native cryptocurrency they lock as collateral (stake). Creating multiple identities does not increase influence unless the attacker divides their capital, which provides no advantage. Malicious behavior is deterred by slashing conditions—programmable penalties that destroy a portion of the staked assets.

• Capital efficiency: Does not require massive energy expenditure
• Economic security: The cost to attack the network is directly quantifiable as the value of staked assets required
• Example: Ethereum's transition to PoS reduced energy use by ~99.95% while maintaining Sybil resistance through a minimum 32 ETH validator stake

A decentralized Sybil resistance model that relies on the structure of a social graph rather than economic resources. Identities are validated through a network of transitive trust relationships, where an attacker's Sybil nodes remain isolated in the graph because they cannot establish genuine trust edges to the honest core. Algorithms like EigenTrust and SybilGuard detect attack clusters by analyzing graph connectivity patterns.

• Trust transitivity: If A trusts B and B trusts C, A derives a measure of trust for C
• Attack surface: Sybil clusters form dense subgraphs internally but have a sparse attack edge count connecting to the honest region
• Application: Used in P2P file-sharing reputation (e.g., early Gnutella proposals) and decentralized social protocols like BrightID

A Sybil resistance technique that binds each identity to a unique, verifiable human being through biometric or liveness verification. Unlike resource-based defenses, PoP ensures one-person-one-vote by making it impossible for a single human to register multiple times. The Worldcoin project uses iris-scanning orbs to generate a unique IrisHash, while Proof of Humanity relies on social verification with video submission and challenge periods.

• Uniqueness guarantee: Biometric entropy ensures distinct identities
• Privacy tension: Requires careful implementation of zero-knowledge proofs to avoid linking biometric data to real-world identity
• Challenge: Global distribution of secure biometric orbs and resistance to deepfake spoofing

A class of Sybil defenses that require prospective members to solve a puzzle or perform a task that is easy for a legitimate user but costly at scale. CAPTCHAs are the most common example, designed to be trivial for humans but difficult for automated bots. More sophisticated variants include proof-of-bandwidth, where nodes must demonstrate sustained upload capacity, and proof-of-storage, where nodes prove they are dedicating disk space.

• Asymmetry principle: Verification of the solution must be cheap; generation must be expensive
• Filecoin uses proof-of-replication and proof-of-spacetime to ensure storage miners are not Sybil identities pretending to store data
• Limitation: Advances in ML and CAPTCHA-solving services erode the effectiveness of purely cognitive tests

A non-transferable, non-financialized identity primitive proposed by Vitalik Buterin that represents commitments, credentials, and affiliations. Because Soulbound Tokens cannot be sold or transferred between wallets, they prevent an attacker from consolidating reputation from multiple Sybil identities into a single account. Combined with Verifiable Credentials (W3C standard), they enable privacy-preserving Sybil resistance where a user can prove attributes without revealing their full identity.

• Non-transferability: Tokens are permanently bound to a specific Soul (account)
• Composability: Multiple SBTs from different issuers (university, employer, DAO) form a rich, non-monetary reputation graph
• Recovery concern: Requires a robust social recovery mechanism to prevent permanent loss of identity if keys are compromised

A consensus mechanism that requires computational expenditure to create new identities, making Sybil attacks economically prohibitive. Each identity must solve a cryptographic puzzle, tying identity creation to real-world resource consumption.

• Hashcash pioneered the concept for email spam prevention
• Bitcoin applies PoW to secure the network against Sybil nodes
• Cost scales linearly with the number of fake identities attempted

A Sybil resistance mechanism where voting power is proportional to staked economic value rather than per-identity. An attacker must acquire a majority of the staked asset to subvert the system, making attacks self-defeating.

• Ethereum transitioned to PoS to improve energy efficiency
• Slashing conditions destroy stake for malicious behavior
• Economic security scales with the market cap of the staked token

A protocol that cryptographically verifies that each identity corresponds to a unique human being, without revealing personal information. Designed to enable democratic governance and fair airdrops in decentralized systems.

• Worldcoin uses biometric iris scanning for uniqueness verification
• BrightID relies on social graph analysis and verification parties
• Idena requires participants to solve flip-tests simultaneously

Sybil resistance through analysis of the social network topology, where genuine users form densely connected clusters and fake accounts appear as sparse, low-connectivity nodes. Trust propagates through verified social relationships.

• EigenTrust computes global trust via transitive relationships
• Advogato pioneered trust metrics for open-source communities
• Attack edges between honest and Sybil regions are the key vulnerability

Defense mechanisms that impose per-entity costs using scarce resources that are difficult to hoard or virtualize. These include computational puzzles, memory-hard functions, and bandwidth proofs.

• Cuckoo Cycle requires memory bandwidth rather than computation
• Proof-of-Space ties identity to dedicated storage allocation
• Proof-of-Elapsed-Time uses trusted execution environments for fair wait times

W3C-standardized digital identity infrastructure where trusted issuers provide tamper-evident credentials. Decentralized Identifiers enable entities to prove attributes without a central registry, binding reputation to cryptographically verifiable claims.

• Verifiable Credentials support selective disclosure of attributes
• DID methods define how identifiers are created and resolved
• Enables reputation portability across distinct trust domains