Overview
Block propagation is the process by which a newly mined block is distributed from the miner who found it to every other node in the Bitcoin peer-to-peer network. This process is fundamental to Bitcoin's consensus mechanism: all nodes must converge on the same chain of blocks, and the speed at which blocks propagate directly impacts network security, mining fairness, and the probability of chain forks.
When a miner discovers a valid proof of work, they immediately broadcast the block to their connected peers. Each peer validates the block and forwards it to their own peers, creating a cascade effect that propagates the block across the entire global network. In the early days of Bitcoin, a full block could take 30 seconds or more to reach most of the network. Modern optimizations have reduced this to under a second in most cases.
How Blocks Propagate
Miner discovers block
│
▼
┌─────────────────┐
│ Miner's node │
│ validates block │
│ locally │
└────────┬────────┘
│
┌────┴────┬──────────┐
▼ ▼ ▼
Peer A Peer B Peer C
│ │ │
├──┐ ├──┐ ├──┐
▼ ▼ ▼ ▼ ▼ ▼
D E F G H I ← ~1-3 hops to reach most nodes
... ... ... ... ... ...
(entire network)
Timeline:
t=0s Miner finds block
t=0.1s Direct peers receive compact block
t=0.5s ~50% of network has the block
t=1-2s ~90% of network has the block
t=3-5s ~99% of network has the block
Why Speed Matters
The speed of block propagation has profound consequences for the Bitcoin network:
Orphan rate: If two miners find valid blocks at nearly the same time, the network temporarily forks into two competing chains. The block that propagates faster is more likely to be built upon by other miners and become the canonical chain, while the slower block becomes an orphan. Faster propagation reduces the window in which such races can occur, lowering the overall orphan rate.
Mining fairness: Larger mining pools have a natural advantage when propagation is slow because they can begin mining on their own blocks immediately. During the propagation delay, smaller miners are effectively wasting hash power on the previous block. This creates centralization pressure toward larger pools. Reducing propagation time to near-zero levels the competitive playing field.
Attack resistance: Slower propagation increases the viability of attacks like selfish mining, where an attacker withholds blocks and releases them strategically. The longer it takes for honest blocks to propagate, the more advantage a well-connected selfish miner gains.
Propagation Optimizations
The Bitcoin network has undergone significant optimization of block propagation over the years:
Compact Block Relay (BIP152): Instead of sending full blocks, nodes transmit compact block messages containing short transaction identifiers. The receiving node reconstructs the block from its local mempool, reducing transmitted data from megabytes to kilobytes and cutting propagation time by an order of magnitude.
FIBRE (Fast Internet Bitcoin Relay Engine): A purpose-built relay network created by Matt Corallo that uses UDP, forward error correction, and dedicated infrastructure to achieve sub-second block propagation globally. While FIBRE itself was discontinued, its ideas influenced other relay networks and Bitcoin Core's design.
Headers-first synchronization: Nodes exchange block headers before full block data, allowing peers to begin validation and chain selection before the full block arrives.
Erlay (proposed): A bandwidth-efficient transaction relay protocol that reduces the redundant transaction announcements in the network, indirectly improving block propagation by ensuring mempools are better synchronized across nodes.
Measuring Propagation
Block propagation speed is monitored by various network observatories and research projects. Key metrics include:
Metric Good Concerning
───────────────────────────────────────────────
50th percentile latency < 1s > 5s
90th percentile latency < 3s > 10s
Orphan rate < 0.1% > 1%
Average block size impact Minimal Linear slowdown
The relationship between block size and propagation time was historically linear — larger blocks took proportionally longer to propagate. Compact block relay largely broke this relationship, as propagation time now depends primarily on how well-synchronized the receiving node's mempool is, not on the raw block size.
Related Concepts
- Compact Block Relay — BIP152 protocol that dramatically speeds up propagation
- Block — the data structure being propagated
- Orphan Block — blocks that lose propagation races
- P2P — the peer-to-peer network through which blocks propagate
- Selfish Mining — an attack mitigated by fast propagation
- Full Node — nodes that validate and relay propagated blocks