Skip to content

Validator Latency vs. Block Time

An interactive feasibility calculator: find the point beyond which validators can't keep up. A freshly produced block must gossip across the validator set and execute before the next block is due.

How the model works

A validator keeps up only if a freshly produced block fully gossips across the validator set and executes before the next block is due:

required = latency × gossip_hops + exec        sustainable  ⟺  required ≤ block_time
  • Gossip hops — blocks spread epidemically, reaching N validators in about ceil(log2(N)) rounds, each costing one network-latency hop.
  • Execution — either a fixed per-block time, or derived from throughput: a block at TPS over block_time carries TPS × block_time transactions, each costing perTx microseconds.
  • Headroom — the fraction of the block-time budget left after gossip and execution. Comfortable (green) above 25%, a tightening danger zone (yellow) below it, and falling behind (red) once required exceeds the block time.

Note

This is a planning aid that models the gossip-plus-execution feasibility boundary. Real-world performance also depends on network topology, payload sizes, and consensus specifics — validate against measurements for your deployment.