Description
TL;DR: A pre-Bitcoin distributed-systems paper asking how replicated services can agree without stripping away randomness that protects application integrity.
About This Document
Wenbing Zhao examines state-machine replication when faulty replicas may act maliciously and deterministic execution can itself weaken security. The paper presents two coordination approaches: one based on Byzantine agreement and another based on threshold coin tossing. It compares their strengths, performance, and suitable use cases while emphasizing that forcing every internal operation to become predictable can compromise systems that rely on random identifiers, shuffling, or other randomized behavior.
Why Bitcoin People May Care
This predates Bitcoin and does not describe Nakamoto consensus. It belongs in the technical background because Bitcoin also coordinates untrusted participants, uses distributed state, and depends on careful assumptions about adversaries and randomness. Byzantine-fault-tolerant replicas and an open proof-of-work network solve different coordination problems, so the value is comparison rather than a claim of direct implementation relevance.
What You Receive
Purchase reveals the verified preserved PDF location for this document.
Document Details
- Title: Integrity-Enhancing Replica Coordination for Byzantine Fault Tolerance
- Author / organization: Wenbing Zhao
- Year: 2008
- Language: English
- Document type: Distributed-systems research paper
- Pages: 10
CacheRat provides researched source-location and document-identification information. CacheRat does not claim ownership of the underlying third-party documentation.
