Mathematical Analysis and Algorithms for Federated Byzantine Agreement Systems

by   André Gaul, et al.

We give an introduction to federated Byzantine agreement systems (FBAS) with many examples ranging from small "academic" cases to the current Stellar network. We then analyze the main concepts from a mathematical and an algorithmic point of view. Based on work of Lachowski we derive algorithms for quorum enumeration, checking quorum intersection, and computing the intact nodes with respect to a given set of ill-behaved (Byzantine) nodes. We also show that from the viewpoint of the intactness probability of nodes, which we introduce in this paper, a hierarchical setup of nodes is inferior to an arrangement that we call a symmetric simple FBAS. All algorithms described in this paper are implemented in the Python package Stellar Observatory, which is also used in some of the computed examples.



There are no comments yet.


page 1

page 2

page 3

page 4


Centrality of nodes in Federated Byzantine Agreement Systems

The federated Byzantine agreement system (FBAS) is a consensus model int...

Complexity of the quorum intersection property of the Federated Byzantine Agreement System

A Federated Byzantine Agreement System is defined as a pair (V, Q) compr...

Federated Byzantine Quorum Systems (Extended Version)

Some of the recent blockchain proposals, such as Stellar and Ripple, use...

Byzantine Preferential Voting

In the Byzantine agreement problem, n nodes with possibly different inpu...

The Sum of Its Parts: Analysis of Federated Byzantine Agreement Systems

Federated Byzantine Agreement Systems (FBASs) are a fascinating new para...

Is Stellar As Secure As You Think?

Stellar is one of the top ten cryptocurrencies in terms of market capita...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.