Block Propagation

When a producer creates a block, that block initially exists at one machine. It must spread across a peer-to-peer network before other nodes can validate and build on it. The time between creation and broad awareness is propagation delay.

During that interval, another producer may still be working on the previous tip and create a competing block. Fast propagation therefore reduces accidental disagreement.

Nodes announce new block identifiers or headers to peers. Peers that do not already have the block request missing data, validate it, and relay it onward. Because each node maintains only a subset of all possible connections, the block travels through multiple hops.

Peer selection, bandwidth, latency, and validation speed determine how quickly the information reaches the network edge.

Many peers already possess most transactions in a new block from their mempools. Compact block protocols send short transaction identifiers plus enough information to reconstruct the block from local mempool contents. The receiver requests only missing transactions.

This reduces bandwidth and can shorten relay time, especially for large blocks containing familiar transactions.

A miner whose blocks propagate slowly has a greater chance of seeing valid work displaced by a competing branch. Large pools invest in low-latency relay networks for this reason. If only a few operators can afford privileged networking, propagation can create centralization pressure.

Protocols try to reduce this advantage through efficient relay and block-design choices.

A node must receive enough data, reconstruct the block, perform preliminary checks, and validate it. Large execution workloads, disk bottlenecks, or signature verification can delay forwarding even on a fast link. Propagation performance is therefore a pipeline across networking and validation.

Increasing block capacity without improving this pipeline can raise stale-block risk.

Block propagation is the race to make a newly produced block visible across a decentralized network. The producer first sends the block, or enough information to reconstruct it, to connected peers. Those peers validate and relay it onward. Because connections differ in bandwidth, latency, geography, and load, the block reaches different nodes at different times.

Propagation delay has consensus consequences. If another miner or validator has not yet learned about the newest block, it may continue building on the previous tip and create a competing block. Faster dissemination reduces the window in which honest participants unknowingly work on different branches.

Protocols and implementations therefore use relay optimizations. Instead of sending every transaction in full when peers likely already have most of them, a node can send compact identifiers plus missing data. Peer-selection strategies can favor diverse, low-latency paths. Some networks use specialized relay infrastructure in addition to ordinary peer-to-peer links.

There is a decentralization trade-off. Very large blocks may increase capacity but take longer to transmit and verify, giving well-connected operators an advantage over slower participants. Measuring propagation therefore helps evaluate not only speed but also fairness and fork risk.

The relevant metric is not simply internet bandwidth. End-to-end delay includes serialization, queueing, transmission, validation, block reconstruction, and relay behavior.

1. Trace how a new block moves from its producer to distant peers.

2. Why can propagation delay create temporary competing branches?

3. How do compact-block techniques reduce bandwidth?

4. Why can larger blocks increase centralization pressure?

5. Name three sources of end-to-end propagation delay besides raw link speed.

6. Correct this statement: “Once one validator has a block, every other node receives it immediately.”