Parsing Parachains - the Who, the What and the Why
summary
Implementation moves availability and validity from paper to working code: parachain candidates are two-phase inclusion — a small assigned group signs a block, then validators receive erasure-coded chunks (split into 3f+1 pieces recoverable from f+1). Erasure coding is optimized from O(n^2) to O(n log n) with a reported 400× speedup. Deployed on Kusama with ~900 validators; main remaining bottleneck is networking and validator CPU (tens of block executions/sec), parathreads need a scheduler + auctions + collation changes to work reliably.
AI-written summary · about
chapters (11)
- 0:00Introduction and panel
- 1:20Availability and validity
- 4:20Erasure coding and optimization
- 7:12Implementing the protocol
- 10:26Refining the parachain design
- 12:41Networking and validation challenges
- 16:03The validation process
- 18:08Parathreads and scheduling
- 20:24XCMP and message handling
- 22:50Scalability and future goals
- 26:50Conclusion and next steps
related talks
21mParachains Decoded
12msub0 Asia 2024 - Axay Sagathiya (Chainsafe)
27mAn Introduction to Polkadot and Parachains
29mMoving from Sidechains to Parachains
27mWar and Peace: The Multi-Chain Reality
10mPolkadot’s Parachain Landscape: An Ecosystem Overview
18mKeynote – Peter Mauric
31mParity Aura to Minimum Viable Proof-of-Stake Sidechain