7 citations · 9 across the 4 of their papers we have counts for
4 papers
From Weakly-terminating Binary Agreement and Reliable Broadcast to Atomic Broadcast
Andreas Fackler, Samuel Schlesinger, Matthew Doty
We present a novel and simple solution to Atomic Broadcast (AB). We reduce AB to two subproblems. One of them is Reliable Broadcast (RB). We also introduce a subproblem we call Wea…
Highway: Efficient Consensus with Flexible Finality
Daniel Kane, Andreas Fackler, Adam Gągol +1
There has been recently a lot of progress in designing efficient partially synchronous BFT consensus protocols that are meant to serve as core consensus engines for Proof of Stake…
Protocol for Asynchronous, Reliable, Secure and Efficient Consensus (PARSEC) Version 2.0
Pierre Chevalier, Bartlomiej Kaminski, Fraser Hutchison +4
In this paper we present an open source, fully asynchronous, leaderless algorithm for reaching consensus in the presence of Byzantine faults in an asynchronous network. We prove th…
A topological set theory implied by ZF and GPK
Andreas Fackler
We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Z…