Optimum Peer-Turbo: A Scalable and Efficient Solution for P2P Broadcasting

TL;DR

Peer Turbo employs Random Linear Network Coding in P2P broadcasting to significantly reduce source bandwidth and latency, enhancing scalability and efficiency in blockchain systems.

Contribution

Introduces Peer Turbo, a novel RLNC-based technique enabling peers to assist each other, reducing source bandwidth and latency in P2P broadcast topologies.

Findings

Reduces source bandwidth by up to ten times.

Decreases propagation latency by an order of magnitude.

Improves scalability of blockchain broadcast architectures.

Abstract

Blockchain systems such as Solana or Monad employ tree- or star-shaped broadcast topologies in which a single source node disseminates message shards to a set of target peers within a strictly bounded time window. In these architectures, shard propagation must complete before the next consensus step, making timely delivery to a large fraction of the validator set essential. A fundamental limitation of such designs is that the outbound bandwidth of the source node constitutes the primary system bottleneck. In this paper, we introduce peer Turbo, a technique that allows target nodes to exchange shards using Random Linear Network Coding (RLNC), thereby assisting each other in completing decoding without requiring explicit shard state coordination. We use a tractable fluid approximation of the degree of freedom distribution of peer-Turbo-enabled systems show that this approach reduces source bandwidth required for a set service quality by up to one order of magnitude, or equivalently reduces propagation latency by one order of magnitude under fixed bandwidth constraints.