Filters








3 Hits in 6.3 sec

Byzantine Fault Tolerant Causal Ordering [article]

Anshuman Misra, Ajay Kshemkalyani
2021 arXiv   pre-print
Previous work in the area focused on ordering point-to-point messages in a fault-free setting, and on ordering broadcasts under various fault models.  ...  Causal ordering in an asynchronous system has many applications in distributed computing, including in replicated databases and real-time collaborative software.  ...  Liskov, “Practical byzantine fault tolerance,” in Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, USA, February 22  ... 
arXiv:2112.11337v1 fatcat:hy7ruo7mrnfddmysyhrgqoogxm

Scalable and Probabilistic Leaderless BFT Consensus through Metastability [article]

Team Rocket, Maofan Yin, Kevin Sekniqi, Robbert van Renesse, Emin Gün Sirer
2020 arXiv   pre-print
For our implementation and setup, the bottleneck of the system is in transaction verification.  ...  Unlike blockchains that rely on proof-of-work, they are quiescent and green.  ...  We quantify the bounds on the discrepancy in Appendix A.7.  ... 
arXiv:1906.08936v2 fatcat:bj4nqc27qvh3nlk6nifhel5x5q

An Efficient and Robust Committee Structure for Sharding Blockchain [article]

Mengqian Zhang, Jichen Li, Zhaohua Chen, Hongyin Chen, Xiaotie Deng
2021 arXiv   pre-print
Under the design, we prove that malicious leaders will not hurt the system and will be evicted. Furthermore, we conduct a series of simulations to evaluate our design.  ...  In addition, we introduce a referee committee and partial sets in each committee, and design a recovery procedure in case the leader is malicious.  ...  Liskov, “Practical byzantine fault tolerance,” in Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, USA, February 22  ... 
arXiv:2112.15322v1 fatcat:uaqrt57nt5hhxm6lxl5zua4jmq