Parameter-independent Iterative Approximate Byzantine Consensus

TL;DR

This paper investigates iterative approximate Byzantine consensus algorithms that operate without relying on the global parameter of the network, such as the maximum number of faulty nodes, f.

Contribution

It introduces parameter-independent algorithms for Byzantine consensus, removing the need for prior knowledge of fault bounds, which enhances robustness and applicability.

Findings

Algorithms achieve consensus without global fault parameters

Improved robustness in Byzantine environments

Potential for broader application in distributed systems

Abstract

In this work, we explore iterative approximate Byzantine consensus algorithms that do not make explicit use of the global parameter of the graph, i.e., the upper-bound on the number of faults, f.