sub0 Asia 2024 - Axay Sagathiya (Chainsafe)
summary
Explains how erasure coding splits a parachain block plus validity proof into 6 fragments (4 data + 2 parity), sends fragments to relay‑chain validators, and reconstructs the block if up to two fragments are lost; Polkadot uses this to shrink candidate receipts and keep parachain state available. Implementation uses a Reed‑Solomon polynomial basis with encoding in O(n log k) and decoding in O(n log n) finite‑field ops, implemented inside the Go parachain host.
AI-written summary · about
chapters (7)
- 0:00Introduction
- 0:46Eraser coding basics
- 2:55Eraser coding example
- 4:03Advantages and tradeoffs of eraser coding
- 5:30Eraser coding in Polkadot host
- 9:22Polkadot’s eraser coding
- 10:25Q&A
related talks
28mParsing Parachains - the Who, the What and the Why
27mAn Introduction to Polkadot and Parachains
26mParachains – Disrupting the Layer One Landscape
52mA barstool chat
28mCommon Good Parachains
24mValidity and the future of blockchains
20mIntroduction to Polkadot
25mCollator Protocol & Censorship Resistance