TL;DR
Mokka is a BFT consensus algorithm designed for open networks, combining RAFT-like approaches with a design optimized for distributed ledger technology, ensuring strong consistency in partial-synchronous environments.
Contribution
Mokka introduces a novel BFT consensus algorithm that adapts RAFT-like methods for improved performance and reliability in distributed ledger applications.
Findings
Achieves strong consistency in partial-synchronous networks
Optimized for distributed ledger technology
Improves upon existing BFT consensus algorithms
Abstract
Mokka is a partial-synchronous, strong consistent BFT consensus algorithm for reaching the consensus about a certain value in open networks. This algorithm has some common approaches nested from RAFT, but its nature and design make Mokka a better solution for DLT (distributed ledger).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Cryptography and Data Security · Access Control and Trust