research
∙
08/11/2021
A Limitlessly Scalable Transaction System
We present Accept, a simple, asynchronous transaction system that achiev...
share
research
∙
08/09/2021
Two-Class (r,k)-Coloring: Coloring with Service Guarantees
This paper introduces the Two-Class (r,k)-Coloring problem: Given a fixe...
research
∙
09/04/2020
FnF-BFT: Exploring Performance Limits of BFT Protocols
We introduce FnF-BFT, a parallel-leader byzantine fault-tolerant state-m...
research
∙
06/25/2019
A Permit-Based Optimistic Byzantine Ledger
PermitBFT solves the byzantine consensus problem for n nodes tolerating ...
research
∙
06/04/2018
