PPL 133 / 177 permanent IDsPrize Problem Ledger · PPLChecked 2026.07.27
Prize Problem LedgerEthereum Proximity PrizePPL 133Proximity Prize · Grand list-decoding challenge

Permanent problem IDPPL 133

Renewal checkInstitutionalconjecture

Coding theory

Proximity Prize · Grand list-decoding challenge

For the formal prize parameters, determine the largest normalized distance δ* for which the relevant Reed–Solomon list size remains at most the target fraction of the field.

Reed–Solomon codeslist decodingproof systems
01

The problem

For the formal prize parameters, determine the largest normalized distance δ* for which the relevant Reed–Solomon list size remains at most the target fraction of the field.

Open since2025program origin; formal paper 2026
Last checked2026.07.27Catalog verification
02

Reward offers

Offer 01Share of $1,000,000 poolEthereum Foundation Proximity Prize
Conditional

This 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.

03

Sources & reading