A Lower Bound

Several sorts are known that take $n \log n$ time (mergesort, quicksort, heapsort, and several others).

Is that as fast as one can go?

If we insist that sorting by done by comparison only, the answer is yes!