From bf79c453d9964d3e1dbc341537e29ff29253fed5 Mon Sep 17 00:00:00 2001 From: Dudley Date: Thu, 21 May 2020 16:12:20 +0200 Subject: [PATCH] updated from k < 3 to 0 < k <= 3 (#1119) Co-authored-by: dud1337 --- polkadot/erasure-coding/src/lib.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/polkadot/erasure-coding/src/lib.rs b/polkadot/erasure-coding/src/lib.rs index 2beaa788e2..98a2776d88 100644 --- a/polkadot/erasure-coding/src/lib.rs +++ b/polkadot/erasure-coding/src/lib.rs @@ -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.