Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Hamster: A Fast Synchronous Byzantine Fault Tolerance Protocol

Ximing Fu, Mo Li, Qingming Zeng, Tianyang Li, Shenghao Yang, Yonghui Guan, Chuanyi Liu

Abstract

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: A Fast Synchronous Byzantine Fault Tolerance Protocol

Abstract

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 nodes is that of Sync HotStuff, and this gain increases to as the network scales to nodes.
Paper Structure (30 sections, 7 theorems, 15 equations, 12 figures)

This paper contains 30 sections, 7 theorems, 15 equations, 12 figures.

Table of Contents

  1. Introduction
  2. Preliminaries
  3. Throughput Issue
  4. Coding Technique and Issues
  5. Cryptographic Primitives
  6. Hamster under Standard Synchrony Model
  7. Data Structures and Properties
  8. Steady-State Phase
  9. Further Discussion
  10. View-Change Phase
  11. Weak Safety and Liveness
  12. Follow Phase
  13. Coding and Merkle Proof
  14. Safety
  15. Performance Analysis
  16. ...and 15 more sections

Key Result

Lemma 1

If an honest node $r$ directly commits $I_h$ in view $v$ at time $t$, then (i) At least one honest node successfully decoded $B_h$ in view $v$ corresponding to $I_h$. (ii) No nodes can generate an equivocating certificate in view $v$. (iii) Every honest node locks on a certificate ranked equal to or

Figures (12)

  • Figure 1: Throughput of Sync HotStuff over bandwidth for different node numbers with $\Delta=100$ ms.
  • Figure 2: The Steady-State protocol under standard synchrony.
  • Figure 3: The View-Change protocol under standard synchrony.
  • Figure 4: The Follow phase under standard synchrony.
  • Figure 5: Fork Process, the commit will happen after the next round's propose
  • ...and 7 more figures

Theorems & Definitions (17)

  • Definition 1: Extension
  • Definition 2: Quorum Certificate
  • Definition 3: Rank
  • Lemma 1
  • Proof 1
  • Lemma 2
  • Proof 2
  • Theorem 1: Weak Safety
  • Proof 3
  • Theorem 2: Liveness
  • ...and 7 more