#erasure-coding #polkadot #availability #system #root #data #merkle

polkadot-erasure-coding

Erasure coding used for Polkadot's availability system

16 major breaking releases

16.0.0 Sep 26, 2024
15.0.0 Jul 18, 2024
14.0.0 Jun 21, 2024
13.0.0 May 23, 2024
0.0.0 Nov 21, 2022

#8 in #erasure-coding

Download history 646/week @ 2024-09-05 708/week @ 2024-09-12 810/week @ 2024-09-19 1364/week @ 2024-09-26 730/week @ 2024-10-03 760/week @ 2024-10-10 986/week @ 2024-10-17 878/week @ 2024-10-24 1090/week @ 2024-10-31 798/week @ 2024-11-07 1223/week @ 2024-11-14 1336/week @ 2024-11-21 1123/week @ 2024-11-28 1449/week @ 2024-12-05 1627/week @ 2024-12-12 1125/week @ 2024-12-19

5,532 downloads per month
Used in 33 crates (9 directly)

GPL-3.0-only

20KB
299 lines

Release

Polkadot SDK stable2409


lib.rs:

As part of Polkadot's availability system, certain pieces of data for each block are required to be kept available.

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, 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.

Dependencies

~23–33MB
~556K SLoC