Description
TL;DR: A distributed-storage construction designed to reconstruct and repair encoded data even when some participating nodes provide corrupted symbols.
About This Document
Yunghsiang S. Han, Rong Zheng, and Wai Ho Mow study exact regenerating codes under both crash-stop and Byzantine faults. Their approach adds integrity checking and progressive decoding so a collector or replacement node can request more symbols as necessary, locate bad contributions, and recover the intended data without abandoning bandwidth-efficient repair.
Why Bitcoin People May Care
This is not Bitcoin consensus. The system repairs stored coded data among defined nodes; it does not establish an open transaction history under proof of work. It remains relevant background because decentralized systems must separate availability failures from adversarial corruption. The paper supplies formal tools for that storage problem, with results limited to its code construction and threat model.
What You Receive
Purchase reveals the verified preserved PDF location for this document.
Document Details
- Title: Exact Regenerating Codes for Byzantine Fault Tolerance
- Author / organization: Yunghsiang S. Han, Rong Zheng, and Wai Ho Mow
- Year: 2011
- Language: English
- Document type: Distributed-storage research paper
- Pages: 9
CacheRat provides researched source-location and document-identification information. CacheRat does not claim ownership of the underlying third-party documentation.
