This paper introduces Hamster, a novel synchronous Byzantine Fault Tolerance protocol that achieves better performance and has weaker dependency on synchrony. Specifically, Hamster employs coding techniques to significantly decrease communication complexity and addresses coding related security issues. Consequently, Hamster achieves a throughput gain that increases linearly with the number of nodes, compared to Sync HotStuff. By adjusting the block size, Hamster outperforms Sync HotStuff in terms of both throughput and latency. Moreover, With minor modifications, Hamster can also function effectively in mobile sluggish environments, further reducing its dependency on strict synchrony. We implement Hamster and the experimental results demonstrate its performance advantages. Specifically, Hamster's throughput in a network of $9$ nodes is $2.5\times$ that of Sync HotStuff, and this gain increases to $10$ as the network scales to $65$ nodes.

翻译：本文介绍了一种新型同步拜占庭容错协议Hamster，该协议实现了更优的性能，并对同步性假设的依赖更弱。具体而言，Hamster采用编码技术显著降低了通信复杂度，并解决了与编码相关的安全问题。因此，与Sync HotStuff相比，Hamster实现了随节点数量线性增长的吞吐量增益。通过调整区块大小，Hamster在吞吐量和延迟方面均优于Sync HotStuff。此外，经过少量修改，Hamster也能在移动迟缓的网络环境中有效运行，进一步降低了对严格同步性的依赖。我们实现了Hamster，实验结果表明了其性能优势。具体来说，在$9$个节点的网络中，Hamster的吞吐量是Sync HotStuff的$2.5$倍；当网络规模扩展至$65$个节点时，该增益提升至$10$倍。