EUVIMEDEUVIMED entdecken
Crossref

EBFT: Simplifying BFT Consensus Through Egalitarianism

Jianyu Niu, Runchao Han, Hanzheng Lyu, Ivan Beschastnikh, Yinqian Zhang, Chen Feng

IEEE Transactions on Dependable and Secure Computing · 2026-05 · 23 (3) · 7388-7402

DOI: 10.1109/tdsc.2026.3673924 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Dependable and Secure Computing, 2026-05. Verfasst von Jianyu Niu und 5 weiteren Autor:innen. Gefördert von: National Natural Science Foundation of China, Natural Sciences and Engineering Research Council of Canada, Fundamental and Interdisciplinary Disciplines Breakthrough Plan of the Ministry of Education of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We present EBFT , an egalitarian framework of BFT consensus for permissioned blockchains. The key innovation in EBFT is egalitarian block generation: instead of relying on a fixed leader, nodes randomly and non-interactively propose blocks, which makes the system resilient to attacks targeting the leader. By combining the longest-chain rule from Nakamoto consensus with quorum voting from classical BFT, EBFT achieves deterministic safety with a design as simple as Nakamoto consensus. To demonstrate its practicality, we build three protocols: EBFT-Syn for synchronous networks, EBFT-PSyn for partially synchronous networks, and EBFT-Turbo , a variant that incorporates Bitcoin-NG style decoupling to demonstrate the framework’s extensibility towards high performance. We implement EBFT atop the Go version of Bitcoin, btcd . We implemented EBFT-Syn , EBFT-PSyn and EBFT-Turbo in about 920 LoCs in total. This indicates that EBFT can be built on top of existing blockchains with relatively little effort. We evaluate these protocols on EC2 instances with up to 256 nodes. Our evaluation shows that EBFT-Syn ( resp. EBFT-PSyn ) achieves a latency of 6 ( resp. 1) seconds. EBFT-Turbo can process up to 3.2 k transactions per second and has a latency of 8 seconds.

Förderung

  • National Natural Science Foundation of China
  • Natural Sciences and Engineering Research Council of Canada
  • Fundamental and Interdisciplinary Disciplines Breakthrough Plan of the Ministry of Education of China

Zitieren

APA

Niu, J., Han, R., Lyu, H., Beschastnikh, I., Zhang, Y., & Feng, C. (2026). EBFT: Simplifying BFT Consensus Through Egalitarianism. IEEE Transactions on Dependable and Secure Computing, 23(3), 7388-7402. https://doi.org/10.1109/tdsc.2026.3673924

Vancouver

Niu J, Han R, Lyu H, Beschastnikh I, Zhang Y, Feng C. EBFT: Simplifying BFT Consensus Through Egalitarianism. IEEE Transactions on Dependable and Secure Computing. 2026;23(3):7388-7402. doi:10.1109/tdsc.2026.3673924

BibTeX
@article{Niu2026,
  author = {Niu, Jianyu and Han, Runchao and Lyu, Hanzheng and Beschastnikh, Ivan and Zhang, Yinqian and Feng, Chen},
  title = {EBFT: Simplifying BFT Consensus Through Egalitarianism},
  journal = {IEEE Transactions on Dependable and Secure Computing},
  year = {2026},
  volume = {23},
  number = {3},
  pages = {7388--7402},
  doi = {10.1109/tdsc.2026.3673924}
}
Kostenlos starten →