How Things Work #3: Scaling Broadcast with Raptor Codes Today, we explore how Monad uses Raptor Codes to scale broadcast with Kushal Babel and Babak Gilkalaye from Category Labs. Turns out, polynomial commitments are an optional ingredient for effective encoding schemes.

Watch on YouTube:

Listen on Spotify:

Listen on Apple Podcasts:

INTRODUCING: Agentic Security - LLM Security Scanner! 🔍 🔑 Features: Scans for prompt injections, jailbreaking & more. Provides detailed reports & options to customize attack rules. 🔗access the GitHub Link ↓

@monad_xyz @KushalBabel @category_xyz Gmonad

Thank you for sharing this great talks! This is really an interesting podcast and discussion for high performance tx dissemination scheme. It's very intuitive to use broadcast than unicast (so removing retransmission in tcp) and, instead, utilize FEC for handling packet drops. Really curious the numerical performance comparison when using tpc or udp+coding for given number of validators. (of course, that performance would depend on packet loss rate. so I am also curious which value for the packet loss rate would be proper assumption.) @_patrickogrady @KushalBabel

@monad_xyz @KushalBabel @category_xyz Good thing another group of people have been thinking polynomial commitments for a few years now

@monad_xyz @KushalBabel @category_xyz love seeing real-world applications of Raptor Codes in blockchain infra. Crazy how efficient broadcast can get without relying on polynomial commitments. Monad keeps pushing the envelope on low-latency architecture

@monad_xyz @KushalBabel @category_xyz kaiito yapper mozz

@monad_xyz @KushalBabel @category_xyz great

@monad_xyz @KushalBabel @category_xyz Monad is using raptor code to scale the broadcast for smoot transmission.