mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-06-11 09:31:12 +00:00
updated from k < 3 to 0 < k <= 3 (#1119)
Co-authored-by: dud1337 <grant@dud.li>
This commit is contained in:
@@ -20,7 +20,7 @@
|
||||
//! The way we accomplish this is by erasure coding the data into n pieces
|
||||
//! and constructing a merkle root of the data.
|
||||
//!
|
||||
//! Each of n validators stores their piece of data. We assume n=3f+k, k < 3.
|
||||
//! Each of n validators stores their piece of data. We assume n=3f+k, 0 < k ≤ 3.
|
||||
//! f is the maximum number of faulty validators in the system.
|
||||
//! The data is coded so any f+1 chunks can be used to reconstruct the full data.
|
||||
|
||||
|
||||
Reference in New Issue
Block a user