On: A look at the math that OpenAI claims computes faster Fourier transforms

[Ar-Curunir]

The algorithm from OpenAI works also in prime-order finite fields. Such FFTs are used all over the place in cryptography. So clearly their result is not useless and works in a realistic computational model

[ViscountPenguin → Ar-Curunir]

Huh, I wasn't aware; I haven't looked into the construction, I was just taking the blog posts claims for granted. Does it extend to all finite fields, that'd be super cool if so.