01
The problem
For constant-rate Reed–Solomon codes over the specified smooth domains and rates, determine the largest normalized distance δ* for which the maximum-correlated-agreement error meets the target security level.
Open since2025program origin; formal paper 2026
Last checked2026.07.27Catalog verification
02
Reward offers
Offer 01Share of $1,000,000 poolEthereum Foundation Proximity Prize
ConditionalThis is a preliminary shared prize program rather than a guaranteed per-problem payout. Accepted public, peer-reviewed work may receive all or part of the US$1,000,000 pool; judges may divide it among full, partial and complementary results, and the published details may change.
The two grand challenges share one pool; the listed value is not guaranteed for either record.