Proximity Gaps Conjecture Fails Near Capacity over Prime Fields

In this report we flesh out a sketch by Krachun and Kazanin to prove that for a certain family of Reed-Solomon codes, proximity gaps fail at radii that are $O(1\mathrm{/}\log n)$ below the capacity rate of the code, where $n$ is the length of the code.