Security & Resilience
Sybil attacks, and why identities are not the scarce resource
Protocol referenceSource: Douceur, J. (2002), The Sybil AttackThe attack is described as a peer-identity strategy; no hash-rate or node-count figure is quoted here.
- Written by
- The Bitcoin Data Guide editorial team
- Reviewed by
- Protocol review desk
- Dates
- Published 2026-10-31 · Last reviewed 2026-10-31
Fact
A node can create an unbounded number of peer identities, because joining the peer-to-peer network requires no proof of work and no stake.
Forecast
How much influence a given number of Sybil peers buys depends on the victim's peer-selection rules and connection limits, which the attack model assumes rather than measures.
The attack model
In a peer-to-peer network, a node's view of the network is built from the peers it connects to. If an attacker can present itself as many peers, it can occupy a large share of a victim's connections and influence what the victim hears. The classic Sybil attack is exactly this: create many identities, and use the weight of numbers to gain influence that a single identity could not command.
The reason the attack is a concern in general is that identities in a peer-to-peer network are usually free. There is no central registry to check them against, and no cost to creating another one. A network that decides questions by counting identities is therefore vulnerable to an attacker that can create more of them than the honest participants.
Bitcoin's answer is not to make identities expensive but to make them irrelevant to the questions that matter. A node can create as many peers as it likes, and those peers can relay blocks and transactions, but they cannot produce a valid block without doing the work, and they cannot make an invalid block acceptable. The scarce resource is not identity; it is hash rate, and hash rate cannot be forged.
The assumptions the attack needs
The first assumption is that the victim selects peers without regard to their history. Bitcoin Core's address manager buckets addresses by network group and selects from the new and tried tables at random, so an attacker must control addresses spread across many groups rather than many addresses in one. This raises the number of identities an attacker needs to occupy a useful share of a victim's connections.
The second assumption is that the victim trusts its peers for something that matters. A Sybil peer can withhold a block or relay a stale one, which is the eclipse attack, but it cannot make the victim accept an invalid block. The influence a Sybil buys is over what the victim hears, not over what the victim accepts, and the victim's own validation is the backstop.
The third assumption is that the attacker is not detected. A node that sees an unusual concentration of peers from one network group, or peers that relay stale data, can drop them and reconnect. The model treats the victim as passive, which is a simplification.
What the defence actually is
The defence is twofold. The first part is that consensus does not count identities: a block is valid because it satisfies the rules and carries the work, not because many peers say so. The second part is peer-management hygiene: bucketed address selection, a bounded number of outbound connections, and block-relay-only connections that leak less about the node's activity. Together they make a Sybil attack a way to degrade a node's view rather than a way to change the ledger.
The Sybil attack and the eclipse attack are closely related: a Sybil is the means, and an eclipse is the end. The eclipse attacks page covers the isolation that a Sybil can achieve, and the node verification page explains why a node's own validation is the backstop.
Sources
- Douceur (2002)
- The Sybil Attack — the original formal treatment of identity creation in peer-to-peer systems.
- Bitcoin Core
- Peer-management documentation — connection limits and address-manager bucketing that bound a Sybil's reach.
Related reading
- Security & ResilienceHow the network resists attack, and what happens when it is stressed.
- Can Miners Cheat?What a miner can and cannot do with the block it finds, and why invalid blocks fail.
- Double SpendingHow a double spend works, and why confirmation depth is the defence.
- 51% AttacksWhat a majority of hash rate can achieve, and what it cannot.
- Eclipse AttacksHow a node can be isolated from the honest network, and the defences against it.
- When Your Node Goes OfflineWhy a disconnected node is not a threat, and how it catches up on return.