Angus Gruen

An exciting update from myself and @benediamond (eprint.iacr.org/2025/2010). We show that the 𝘶𝘱-𝘵𝘰-𝘤𝘢𝘱𝘢𝘤𝘪𝘵𝘺 proximity gaps conjecture is 𝗳𝗮𝗹𝘀𝗲. More precisely, given any pair c, d we construct codes whose error grows faster than nᶜ / (q ⋅ (ρ η)ᵈ).

This post got a little more traction that I was expecting. Due to this, I thought it might be useful to jump back in try to give a sense of what our results entail skipping as much of the mathematics as possible. (Warning, long thread ahead)

Currently Plonky3 supports a collection of slightly different fields. I wrote a short note up to explain why we support different fields and the advantages/disadvantages of each:

hackmd.io/@Syxton/small_…