Circle STARKs

ePrint Report: Circle STARKs

Ulrich Haböck, David Levit, Shahar Papini

Traditional STARKs require a cyclic group of a smooth order in the field. This allows efficient interpolation of points using the FFT algorithm, and writing constraints that involve neighboring rows. The Elliptic Curve FFT (ECFFT, Part I and II) introduced a way to make efficient STARKs for any finite field, by using a cyclic group of an elliptic curve. We show a simpler construction in the lines of ECFFT over …

algorithm circle constraints curve elliptic eprint report order points report writing