Reproduce “Efficient and Secure Sleepy Model for BFT Consensus” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Pengkun Ren, Hai Dong, Zahir Tari, Pengcheng Zhang
Researchers from RMIT University and Hohai University developed PVSS-BFT, a Byzantine Fault Tolerant consensus protocol tailored for dynamically available distributed systems. It achieves consensus in typically 4 network delays with resilience against up to 1/2 malicious participants by employing Publicly Verifiable Secret Sharing (PVSS) and a pre-commit mechanism to enhance security and efficiency.
Key insights
- The use of PVSS cryptographically binds block proposals with participation commitments, enabling public verification of share correctness and preventing malicious leaders from distributing conflicting block versions.
- A pre-commit mechanism allows nodes to signal their intent to participate in subsequent views, facilitating dynamic adjustment of participant sets and improving adaptability to fluctuating node availability.
- Formal proofs establish the protocol's safety (non-conflicting blocks) and liveness (eventual transaction inclusion) under an honest majority and a weakly synchronous network model.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.