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.

翻译：区块链系统（如Solana或Monad）采用树形或星形广播拓扑结构，其中单个源节点在严格限定的时间窗口内将消息分片分发至一组目标对等节点。在此类架构中，分片传输必须在下一共识步骤前完成，因此及时将数据送达大部分验证节点集至关重要。此类设计的根本局限在于源节点的出站带宽构成了主要系统瓶颈。本文提出对等多播涡轮技术，该技术允许目标节点使用随机线性网络编码（RLNC）交换分片，从而在无需显式分片状态协调的情况下相互协助完成解码。通过建立基于对等多播涡轮系统的自由度分布的可处理流体近似模型，我们证明该方法可将满足特定服务质量所需的源节点带宽降低一个数量级，或在带宽约束下将传播延迟降低一个数量级。