Comment by jiggawatts

> the algorithm requires you to multiply complex numbers whose magnitudes grow superpolynomially with n.

Err... doesn't that completely invalidate the big-O analysis!?

I suspected that these Open AI "proofs" of sub-nlogn times were cheating somehow, by sweeping something under a rug. This seems to be it!