It’s been a while since we’ve shared academic milestones and/or new technical papers, but today we’re excited to share our newest paper: Probabilistic Byzantine Fault Tolerance.
Byzantine fault tolerance (BFT) has attracted a large body of research in distributed trustless systems that ensure the system’s integrity despite of Byzantine processes. Most previous work in BFT systems are mainly aimed to ensure all (honest) processes agree on common knowledge or common state of the network. However, there is a lack of studies about common knowledge of Byzantine faults, such as, whether all honest processes agree on the existence of a Byzantine process.
To improve our understanding in this direction, Fantom has presented a fresh outlook on BFT systems in which processes may misbehave unpredictably. We propose a novel model in which individual Byzantine processes have some probability of cheating. We give several interesting analyses and intuitions of the model in both synchronous and asynchronous BFT systems.
For more details, see our paper at https://arxiv.org/abs/2002.03087
Official Email Address: firstname.lastname@example.org
Official Website Link: https://www.fantom.foundation
Official Telegram Discussion Group (English): https://t.me/fantom_english
Official Telegram Announcements Channel: https://t.me/fantomfoundation
Official Subreddit: https://www.reddit.com/r/FantomFoundation/
Official Twitter: https://twitter.com/FantomFDN
Official Medium: https://medium.com/fantomfoundation
Official Github: https://github.com/Fantom-foundation
Official YouTube Channel: https://www.youtube.com/c/fantomfoundation
Technical Paper: Probabilistic Byzantine Fault Tolerance was originally published in Fantom Foundation on Medium, where people are continuing the conversation by highlighting and responding to this story.
Write a post
Are you sure you want to delete this post?
Are you sure you want to delete this comment?
Purchase has been completed.
닉네임을 설정 후 작성해주세요.