The video is a workshop hosted by the Ethereum Foundation that explains the mathematics behind their $1 million Proximity Prize. It walks viewers through Reed‑Solomon codes, the Johnson bound, and recent research that could shrink post‑quantum SNARK proof sizes, targeting anyone interested in applied cryptography. No prior coding theory knowledge is required.
ما يغطيه الفيديو
Introduction to Reed‑Solomon codes, polynomial encoding, and decoding radii
Explanation of the Johnson bound and the Mutual Correlated Agreement concept
Discussion of recent soundness‑bound research beyond the Johnson bound by Dao, Kominers, and Thaler
Implications for reducing verifier queries and proof sizes in FRI and WHIR protocols
Overview of better.codes, Lean 4 formal verification, and ways to contribute to open problems
ملخص من COINMAG، مكتوب من وصف الفيديو.
المناقشة 0
كن أول من يعبّرماذا يعني هذا للسوق؟ شارك رأيك وابدأ النقاش.
Why Base's First Tokenized Stocks Launched Outside the US, and What's NextUnchained
المناقشة 0