Deterministic Consensus Algorithm with Linear Per-Bit Complexity

Details Deterministic Consensus Algorithm with Linear Per-Bit Complexity Deterministic Consensus Algorithm with Linear Per-Bit Complexity

2010-08-26

arxiv.org/abs/1008.4551v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

In this report, building on the deterministic multi-valued one-to-many Byzantine agreement (broadcast) algorithm in our recent technical report [2], we introduce a deterministic multi-valued all-to-all Byzantine agreement algorithm (consensus), with linear complexity per bit agreed upon. The discussion in this note is not self-contained, and relies heavily on the material in [2] - please refer to [2] for the necessary background.

Affiliated with

Also associated with

No associations

Rating

Deterministic Consensus Algorithm with Linear Per-Bit Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deterministic Consensus Algorithm with Linear Per-Bit Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deterministic Consensus Algorithm with Linear Per-Bit Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704279