I think it’s fair. Nobody thinks a faster algorithm than n log n will ever be possible. It’s like a mini P!=NP.

You don't know what nobody thinks, because there may be a person that thinks just that. This is an active area of research. Anything quicker than O(nlog n) but slower than O(n) is still possible.