Some researchers and graduate students have developed a new algorithm for FFT.

Here's the news article:
http://web.mit.edu/newsoffice/2012/faster-fourier-transforms-0118.html

Here is their project page (charts, publications, and contact info):
http://groups.csail.mit.edu/netmit/sFFT/

I wonder if this new algorithm (once published) could be used to dramatically increase the size of SETI tasks? Imagine your machine doing 5x to 10x the work in the same download size.

I also wonder if their algorithm would even work that well on SETI noise, given that it's so very random most of the time.

See the obscure and misleading "SODA, with a D" topic...

I don't think it'll be useful because it throws the baby out with the bathwater, and the babies we are looking for are really really really tiny!