Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity

TL;DR

This paper introduces a Byzantine agreement protocol that achieves optimal early stopping, optimal resilience, and polynomial complexity by utilizing multi-layer resolve rules in the EIG tree, improving upon previous sub-optimal methods.

Contribution

It presents the first protocol combining optimal early stopping, resilience, and polynomial complexity for Byzantine agreement using multi-layer resolve rules.

Findings

Achieves Byzantine agreement in minimal rounds with optimal resilience.

Uses polynomial message size and computation.

Introduces multi-layer resolve rules in the EIG tree.

Abstract

We provide the first protocol that solves Byzantine agreement with optimal early stopping ($\min\{f+2,t+1\}$ rounds) and optimal resilience ($n>3t$) using polynomial message size and computation. All previous approaches obtained sub-optimal results and used resolve rules that looked only at the immediate children in the EIG (\emph{Exponential Information Gathering}) tree. At the heart of our solution are new resolve rules that look at multiple layers of the EIG tree.