Definition
Propagation delay is the time it takes for a newly found block, transaction, or mining job to travel across the Bitcoin network from where it originated to every other participant. In mining, that lag decides who hears about the latest work first and whether the effort you just spent counts toward a real reward.
Also known as: block propagation time, network latency.
Why propagation delay exists
Bitcoin is a gossip network with no central coordinator. When a miner finds a block, that block does not appear everywhere at once. It hops node to node, each one validating it before relaying it onward. Geography, peer count, bandwidth, and block size all add to the journey. The same physics applies to a block template flowing the other direction: your hardware can only work on the chain tip it currently knows about, so any delay in receiving fresh work is a delay in mining the correct thing.
This is the network-level cousin of the signal-timing delays inside an ASIC. Both describe a finite time for information to cross a medium; here the medium is the internet rather than a circuit trace, and the stakes are economic rather than electrical.
How delay turns work into wasted work
When two miners find a valid block at nearly the same moment, the network briefly disagrees about the chain tip. The longest chain rule eventually resolves it, but the losing block becomes an orphan block and the proof-of-work behind it earns nothing. The likelihood of this outcome scales with how slowly your block propagates: the longer your win sits unannounced, the more time a competitor has to overwrite it. Faster propagation shrinks that window. It is also why the targeted block time of roughly ten minutes is comfortably larger than typical propagation times, giving the network room to converge before the next block lands.
Propagation delay is also the lever behind selfish mining, a theoretical strategy where a miner deliberately withholds a found block to gain a head start. The defense is the same for everyone: relay quickly, peer widely, and keep your own infrastructure close to the network.
What this means for your ASIC at home
Most home miners run through a mining pool, so the pool absorbs most block-broadcast risk. But propagation delay still reaches your bench in the form of job-delivery latency over the stratum protocol. The pool pushes new work each time the chain tip changes; until that arrives, your hashboard may be hashing against a block that has already been found by someone else. Any share you submit afterward is a stale block candidate, rejected because the work moved on.
The protocol you run matters. D-Central’s protocol research shows that legacy Stratum V1 delivers a fresh job in roughly a couple hundred milliseconds, while the newer binary Stratum V2 pushes the same job in single-digit milliseconds. Only BraiinsOS+ currently speaks Stratum V2, but the broader lesson holds for any setup: lower latency between you and the pool means fewer stale shares and a higher accepted-share ratio. Practical steps follow naturally. Pick a pool with a node geographically near you, use a wired connection rather than congested Wi-Fi, avoid overloaded home routers, and if you run an open-source firmware stack, keep its stratum client tuned for prompt job switching. For solo and lottery setups, running your own full node next to the miner removes a whole hop of delay.
Propagation delay is one more reason the network rewards decentralization: the more well-connected nodes relaying blocks, the faster everyone converges and the fewer honest blocks are lost. Running a node and choosing low-latency, open infrastructure is one more layer decentralized, and it quietly protects the value of every hash your hardware throws. You can compare firmware options and their stratum support on the firmware comparison page, or browse efficient hardware in the miners catalog.
Related terms: Orphan Block, Stale Block, Longest Chain Rule, Stratum Protocol, Selfish Mining, Block Time
In Simple Terms
The time for a new block to spread across the network. Faster propagation reduces competing blocks.
Propagation delay is the time it takes for a newly found block, transaction, or mining job to travel across the Bitcoin network from where it originated to every other participant. In mining, that lag decides who hears about the latest work first and whether the effort you just spent counts toward a real reward.
Also known as: block propagation time, network latency.
Why propagation delay exists
Bitcoin is a gossip network with no central coordinator. When a miner finds a block, that block does not appear everywhere at once. It hops node to node, each one validating it before relaying it onward. Geography, peer count, bandwidth, and block size all add to the journey. The same physics applies to a block template flowing the other direction: your hardware can only work on the chain tip it currently knows about, so any delay in receiving fresh work is a delay in mining the correct thing.
This is the network-level cousin of the signal-timing delays inside an ASIC. Both describe a finite time for information to cross a medium; here the medium is the internet rather than a circuit trace, and the stakes are economic rather than electrical.
How delay turns work into wasted work
When two miners find a valid block at nearly the same moment, the network briefly disagrees about the chain tip. The longest chain rule eventually resolves it, but the losing block becomes an orphan block and the proof-of-work behind it earns nothing. The likelihood of this outcome scales with how slowly your block propagates: the longer your win sits unannounced, the more time a competitor has to overwrite it. Faster propagation shrinks that window. It is also why the targeted block time of roughly ten minutes is comfortably larger than typical propagation times, giving the network room to converge before the next block lands.
Propagation delay is also the lever behind selfish mining, a theoretical strategy where a miner deliberately withholds a found block to gain a head start. The defense is the same for everyone: relay quickly, peer widely, and keep your own infrastructure close to the network.
What this means for your ASIC at home
Most home miners run through a mining pool, so the pool absorbs most block-broadcast risk. But propagation delay still reaches your bench in the form of job-delivery latency over the stratum protocol. The pool pushes new work each time the chain tip changes; until that arrives, your hashboard may be hashing against a block that has already been found by someone else. Any share you submit afterward is a stale block candidate, rejected because the work moved on.
The protocol you run matters. D-Central's protocol research shows that legacy Stratum V1 delivers a fresh job in roughly a couple hundred milliseconds, while the newer binary Stratum V2 pushes the same job in single-digit milliseconds. Only BraiinsOS+ currently speaks Stratum V2, but the broader lesson holds for any setup: lower latency between you and the pool means fewer stale shares and a higher accepted-share ratio. Practical steps follow naturally. Pick a pool with a node geographically near you, use a wired connection rather than congested Wi-Fi, avoid overloaded home routers, and if you run an open-source firmware stack, keep its stratum client tuned for prompt job switching. For solo and lottery setups, running your own full node next to the miner removes a whole hop of delay.
Propagation delay is one more reason the network rewards decentralization: the more well-connected nodes relaying blocks, the faster everyone converges and the fewer honest blocks are lost. Running a node and choosing low-latency, open infrastructure is one more layer decentralized, and it quietly protects the value of every hash your hardware throws. You can compare firmware options and their stratum support on the firmware comparison page, or browse efficient hardware in the miners catalog.
Related terms: Orphan Block, Stale Block, Longest Chain Rule, Stratum Protocol, Selfish Mining, Block Time