4 papers
A Limitlessly Scalable Transaction System
Max Mathys, Roland Schmid, Jakub Sliwinski +1
We present Accept, a simple, asynchronous transaction system that achieves perfect horizontal scaling. Usual blockchain-based transaction systems come with a fundamental throughput…
Two-Class (r,k)-Coloring: Coloring with Service Guarantees
Pál András Papp, Roland Schmid, Valentin Stoppiello +1
This paper introduces the Two-Class (,)-Coloring problem: Given a fixed number of colors, such that only of these colors allow conflicts, what is the minimal numb…
FnF-BFT: Exploring Performance Limits of BFT Protocols
Zeta Avarikioti, Lioba Heimbach, Roland Schmid +3
We introduce FnF-BFT, a parallel-leader byzantine fault-tolerant state-machine replication protocol for the partially synchronous model with theoretical performance bounds during s…
PermitBFT: Exploring the Byzantine Fast-Path
Roland Schmid, Roger Wattenhofer
PermitBFT establishes a permissioned byzantine ledger in the partially synchronous networking model. For n replicas, PermitBFT tolerates up to f < n/3 byzantine replicas. It is the…