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

18 Feb 2019Łukasz Lachowski

A Federated Byzantine Agreement System is defined as a pair $(V, Q)$ comprising a set of nodes $V$ and a quorum function $Q: V \mapsto 2^{2^{V}} \setminus \{\emptyset\}$ specifying for each node a set of subsets of nodes, called quorum slices. A subset of nodes is a quorum if and only if for each of its nodes it also contains at least one of its quorum slices... (read more)

PDF Abstract


No code implementations yet. Submit your code now


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet