A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1

Mukesh Singhal; Nasit S Sony; Xianzhong Ding

REVIEW

A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.23477 v2 pith:AHB7IHMP submitted 2024-10-30 cs.DC cs.CR

Nasit S Sony , Xianzhong Ding , Mukesh Singhal This is my paper

classification cs.DCcs.CR

keywords agreementasynchronousbyzantinecommunicationmvbanetworksprotocolprotocols

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

Multi-valued Byzantine agreement (MVBA) protocols are essential for atomic broadcast and fault-tolerant state machine replication in asynchronous networks. Despite advances, challenges persist in optimizing these protocols for communication and computation efficiency. This paper presents a committee-based MVBA protocol (cMVBA), a novel approach that achieves agreement without extra communication rounds by analyzing message patterns in asynchronous networks with probability 1.

Discussion (0). Sign in to comment.

Pith tools