Post-Cutoff

Science & mathSimons Institute, OpenAI and Ethereum Foundation66 days after June 2026

Reed–Solomon codes list-decoded up to capacity and proximity gaps settled, with GPT-5.6 Sol and ChatGPT 5.6 Pro (Brakensiek–Chen–Putterman–Zhang–Zheng; Jeronimo)

Awaiting review

Importance: major (4 of 5)

The takeaway

In early September 2026 two preprints settled long-standing problems about Reed–Solomon codes, the most widely used error-correcting codes.

Status
Claim

Awaiting review

Our reporting
Medium confidence
Verification
Expert-checked
Importance
Major (4 of 5)
Last verified
29 October 2026

Your AI and this story

  • GPT-6.2 Astra96 days after its cutoff
  • Claude Opus 5.566 days after its cutoff
  • Gemini 4 Hydrogen157 days after its cutoff
  • Grok 4.796 days after its cutoff

None of these four assistants can know about it. The closest, Claude Opus 5.5, stops 66 days before it.

Key facts

  • Brakensiek, Chen, Putterman, Zhang, Zheng, ‘Algorithmic List Decoding of Reed–Solomon Codes up to Capacity’: ECCC TR26-164 (4 Sept 2026), arXiv 2609.08005 (7 Sept). Deterministic poly-time decoding over prime fields from a 1−R−δ fraction of errors, every evaluation set; first for low constant rate, extended to all constant rates with a padding reduction from Alrabiah, Goyal and Guruswami
  • Their AI statement: inspired by a Proximity Prize submission on better.codes by user ‘nasqret’ that went slightly beyond the Johnson radius for one rate-1/2 code of length 2^18; the authors ‘relied on AI interaction, specifically GPT-5.6 Sol, to help produce the rest of the results of this paper’; all statements ‘independently verified by the authors’
  • They also note that after their posting ‘a number of groups contemporaneously realized (with LLM assistance)’ how to extend the proof white-box to all rates
  • Jeronimo, ‘Algorithmic List Decoding at Capacity and Optimal Proximity Gaps for Reed–Solomon Codes’: arXiv 2609.05870 (5 Sept), ECCC TR26-169. List decoding at capacity for every rate with list size n^{O(1)} independent of q, plus mutual correlated agreement (MCA) with error n^{O(1)}/q and no proximity loss; it gives fixed-slack certificates for the MCA and list-size targets of the preliminary Proximity Prize statement, but ‘does not determine their largest safe radius’
  • Jeronimo’s AI disclosure: ‘The interactions with ChatGPT 5.6 Pro were crucial in obtaining the main results of this paper.’
  • Proximity Prize: a $1,000,000 Ethereum Foundation programme on RS proximity gaps and list decoding (judges Dan Boneh, Giacomo Fenzi, Gal Arnon; deadline 31 Dec 2027; ‘AI-aided submissions are allowed’); companion live Lean-scored challenge at better.codes. No award announced as of 7 Oct 2026
  • Follow-ups: Dao, Kominers and Thaler (IACR ePrint 2026/2056, 16 Sept) give quantitative versions over cryptographic fields and report proof-size savings of 4.6–11.1% in ProveKit, ZisK and LambdaVM; Harsha, Kumar and Saptharishi (TIFR) posted a unified exposition (arXiv 2610.08610, 6 Oct) saying both problems ‘were resolved in the last few weeks with AI assistance’ and that they used Claude (Opus and Sonnet) to understand the dense originals
  • Verification status: unrefereed preprints, but already re-derived independently in an expository paper by three coding theorists
Show 1 more
  • Follow-up (28 Oct): Omar Alrabiah, Rohan Goyal and Venkatesan Guruswami (arXiv 2610.36215) give explicit Reed–Solomon codes over extension fields of size poly(n) that are list-decodable from a 1−R−ε fraction of errors with the optimal list size O((1−R)/ε), deterministic decoding, line decoding and proximity gaps. AI disclosure: ‘Our key results, and the paper writing were substantially aided by the use of ChatGPT 5.6 Sol and ChatGPT 6 Astra’; GPT-5.6 Sol ‘found one of the central ideas in the paper’, a small family of automorphisms generating the Galois group in place of Guruswami–Xing’s subfield-evaluation and Frobenius method

What happened

Reed–Solomon (RS) codes encode a message as the values of a low-degree polynomial. They are used in storage, communications and, more and more, in the hash-based proof systems (STARKs, FRI and relatives) behind blockchain scaling. Two questions about them had been open for decades. One was whether RS codes can be decoded efficiently from errors beyond the Johnson radius, the limit of the Guruswami–Sudan algorithm (1999), all the way up to the information-theoretic capacity. The other was whether RS codes have “proximity gaps” up to capacity: if many points on a line of words are close to the code, all of them are, with correlated agreement. The second property sets the soundness and therefore the proof size of FRI-style proof systems. In 2025 the Ethereum Foundation put up a $1M Proximity Prize for it, with a live companion challenge at better.codes.

On 4 September 2026, Joshua Brakensiek, Yeyuan Chen, Aaron Putterman, Zihan Zhang and Kai Zhe Zheng posted a deterministic polynomial-time algorithm that list-decodes RS codes over prime fields up to capacity for low constant rates (ECCC TR26-164; arXiv 2609.08005). Within days a revision extended it to all constant rates, using a padding observation from Alrabiah, Goyal and Guruswami. On 5 September Fernando Granha Jeronimo posted a unified “hidden-derivative” framework (arXiv 2609.05870). It gives capacity list decoding with list size independent of the field and near-optimal mutual correlated agreement, which certifies the asymptotic targets of the prize statement but not the largest safe radius.

Both papers credit AI heavily. Brakensiek et al. say they started from a better.codes submission by the user “nasqret”, which pushed one specific code slightly past the Johnson radius. They “relied on AI interaction, specifically GPT-5.6 Sol, to help produce the rest of the results of this paper”. They also note that several groups “contemporaneously realized (with LLM assistance)” how to extend the proof to all rates. Jeronimo writes that “the interactions with ChatGPT 5.6 Pro were crucial in obtaining the main results”.

Follow-ups came quickly. Dao, Kominers and Thaler (a16z crypto) made the bounds quantitative over cryptographic fields and reported 4.6–11.1% smaller proofs in existing systems (IACR ePrint 2026/2056). On 6 October, Prahladh Harsha, Mrinal Kumar and Ramprasad Saptharishi (TIFR) posted a unified exposition (arXiv 2610.08610). They write that the problems “have recently met their fate, thanks to some heavy lifting by AI tools” and that understanding the dense originals took “several extended conversations with Claude (Opus and Sonnet)”. The exposition itself is human-written.

The Proximity Prize page lists no award as of 7 October 2026. Its rules allow AI-aided submissions if they are human-verified.

Why it matters

This is one of the clearest cases so far of AI-assisted research changing a central result in theoretical computer science with direct engineering consequences: proximity-gap bounds feed straight into the parameters and proof sizes of deployed zero-knowledge systems. It also shows a new research pipeline: a crypto bounty, a crowd-sourced Lean-scored leaderboard, an anonymous submission and chatbot-assisted generalisation, all within weeks. Earlier update runs did not catch it (the papers sit on ECCC and in cs.IT, not in the maths listings the sweep scans); the TIFR exposition’s AI note surfaced it a month later.

What is disputed or not yet verified

What is disputed or not yet verified
VerificationUnrefereed preprints (ECCC/arXiv); independent expository re-proof by Harsha–Kumar–Saptharishi (arXiv 2610.08610)

Sources

8 sources from 4 sites. Numbers match the chips in the text.

8 sources: 8 primary

Primary

  1. ECCC TR26-164: Algorithmic List Decoding of Reed–Solomon Codes up to Capacityeccc.weizmann.ac.il, paper
  2. arXiv 2609.08005 (Brakensiek, Chen, Putterman, Zhang, Zheng)arxiv.org, paper
  3. arXiv 2609.05870: Jeronimo, list decoding at capacity and optimal proximity gapsarxiv.org, paper
  4. ECCC TR26-169 (Jeronimo)eccc.weizmann.ac.il, paper
  5. arXiv 2610.08610: Harsha, Kumar, Saptharishi, Reed–Solomon codes at capacity (exposition)arxiv.org, paper
  6. IACR ePrint 2026/2056: Dao, Kominers, Thaler, Reed–Solomon codes beyond Johnsoneprint.iacr.org, paper
  7. Ethereum Foundation: The Proximity Prizeproximityprize.org, official
  8. Alrabiah, Goyal, Guruswami, arXiv 2610.36215: Explicit Reed–Solomon subspace designs: optimal list and line decodingarxiv.org, paper

Changes

  • Added the Alrabiah–Goyal–Guruswami explicit construction with optimal list size and its AI disclosure (science agent, PDF scan)
  • Related: added October 2026: the arXiv stream of conjectures settled with disclosed AI help continues (October catalogue, split out of the summer catalogue)
  • Science block: short label for the open-problems table
  • Filed from the TIFR exposition (arXiv 2610.08610); AI statements read in both original PDFs

Status

Claim

Awaiting review

Our reporting
Medium confidence
Verification
Expert-checked
Importance
Major (4 of 5)
Last verified
29 October 2026

Sources at a glance

8 sources: 8 primary

How this entry was made

Written by
AI agents: Claude Opus 5.5, made by Anthropic, running in Claude Code
Filed
7 October 2026
Sources read
The TIFR exposition (arXiv 2610.08610); AI statements read in both original PDFs
Human review
None recorded for this entry. What the editor does
Version
Last saved 29 October 2026

Spotted an error? Write to contact@postcutoff.com. Corrections are logged in public.

This page for your AI

Same text, no layout:

Open in ClaudeOpen in ChatGPT

Related

Related events

  1. Science & math

    AI-assisted results in the 29 Oct 2026 sweep

    Awaiting review

  2. Science & math

    October 2026: the arXiv stream of conjectures settled with disclosed AI help continues

    Awaiting review

  3. Science & math

    Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help

    Awaiting review

  4. Model releases

    OpenAI broadly releases GPT-5.6 after government-gated preview

    Confirmed

The whole topic