/quorums

Research tools related to Byzantine quorum systems, e.g., for parsing the quorum systems, checking the Q3 and B3 conditions, checking for the existence of guilds, parsing the quorum slices from the live blockchain of Stellar.

Primary LanguagePython

This repo contains research tools related to Byzantine quorum systems [4,5], such as parsing the quorum and fail-prone systems [4,5], checking the Q3 [5] and B3 conditions [4], checking for the existence of guilds [2, 4], parsing the quorum slices from the live blockchain of Stellar [5] using the stellarbeat API [6].

The tools have been used during the development of various scientific papers, e.g., [1,2,3]. The code has been developed by members and students of the Crypto [7] group at University of Bern.


References:

[1] Orestis Alpos, Christian Cachin, Luca Zanolini: How to Trust Strangers: Composition of Byzantine Quorum Systems. SRDS 2021: 120-131

[2] Christian Cachin, Luca Zanolini: Asymmetric Asynchronous Byzantine Consensus. DPM/CBT@ESORICS 2021: 192-207

[3] Orestis Alpos, Christian Cachin: Consensus Beyond Thresholds: Generalized Byzantine Quorums Made Live. SRDS 2020: 21-30

[4] Christian Cachin, Björn Tackmann: Asymmetric Distributed Trust. OPODIS 2019: 7:1-7:16

[5] Dahlia Malkhi, Michael K. Reiter: Byzantine Quorum Systems. Distributed Comput. 11(4): 203-213 (1998)

[6] https://www.stellar.org/

[6] https://api.stellarbeat.io/docs/

[7] https://crypto.unibe.ch/