Manta: A Fair, Non-Blocking Byzantine Consensus Framework for High-Frequency DeFi
Computer and Decision Making: An International Journal · 03.11.2026 · 3 (6S) · 1112-1122
DOI: 10.1922/comdem.v3i6s.18886 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computer and Decision Making: An International Journal, online erschienen am 03.11.2026. Verfasst von Yosuf Mohamed Ismail Ahmed Hassan und 1 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The MEV resistance–throughput of consensus paradox is emphasized by decentralized finance (DeFi) systems. The block construction with leader implies efficient state machine replication but is susceptible to attacks on transaction data such as front-running, sandwich and back-running attacks. Order-fairness solutions consider visibility of transactions, but may result in cyclic order preferences due to different propagation delays, and in coordination costs that can reduce scalability. While threshold decryption solutions do not need to know the order of the transactions, concealing transactions with cryptography can still lead to throughput limitations in the case of transaction decryption share exchange based on synchronous Byzantine fault tolerance (BFT). In this work, we present Manta, a non-blocking BFT solution which decouples the delivery of encrypted transactions from the threshold decryption. Clients encrypt transactions symmetrically and the symmetric keys for these transactions are encrypted using threshold public-key encryption (TPKE). Leaders continually send in-between blocks and replicas in each view, and speculatively append these blocks without processing. A standard pipelined BFT scheme is used to provide ordering and irreversibility, in the form of Periodic Key Blocks. Manta also adds in Asynchronous Threshold Gatekeeping, where partial THRESHOLD shares of TPKE can be piggybacked on regular COMMIT messages and added up without an additional communication. Manta delivers optimistic responsiveness, long safety, liveness post-global stabilization and a high level of order-fairness, without compromising WAN bandwidth efficiency. We have deployed multi-region WAN using Manta on top of libhotstuff, and have been able to achieve almost 25,000 tps with optimal batching. Also, we observe a 8.4x increase in throughput compared to EquiBFT at 100 replicas, while Manta, F3B and EquiBFT do not extract any adversarial MEV for the workload tested. The results suggest that Manta can be a consensus primitive for high-frequency DeFi applications with the requirements of network usefulness and fairness.
Zitieren
APA
Hassan, Y. M. I. A., & Ahmed, M. (2026). Manta: A Fair, Non-Blocking Byzantine Consensus Framework for High-Frequency DeFi. Computer and Decision Making: An International Journal, 3(6S), 1112-1122. https://doi.org/10.1922/comdem.v3i6s.18886
Vancouver
Hassan YMIA, Ahmed M. Manta: A Fair, Non-Blocking Byzantine Consensus Framework for High-Frequency DeFi. Computer and Decision Making: An International Journal. 2026;3(6S):1112-1122. doi:10.1922/comdem.v3i6s.18886
BibTeX
@article{Hassan2026,
author = {Hassan, Yosuf Mohamed Ismail Ahmed and Ahmed, Marwan},
title = {Manta: A Fair, Non-Blocking Byzantine Consensus Framework for High-Frequency DeFi},
journal = {Computer and Decision Making: An International Journal},
year = {2026},
volume = {3},
number = {6S},
pages = {1112--1122},
doi = {10.1922/comdem.v3i6s.18886}
}
EUVIMED