I thought the nlogn^.9999 was for fft

It was for both fft and integer multiplication (different bounds but both slightly under nlogn)

It was both actually.

No. They have a new upper bound for matrix multiplication, but it's O(n^2.25). You can't do less than n^2 for obvious reasons (size of the input and output).