The above 2^n is just the extreme. There’s always baby steps to that direction. If you want you can point an agent at any known nlogn algorithm (eg. Sorting) and quickly get similar improvements in a similar way. We’re about to see an explosion of ‘complexity bound of x broken!’ as people discover what the creator of complexity theory warned us about. Namely that there’s never hard limits in complexity theory and you can always speed up any time complexity with a cost in space complexity. There never was some impassable nlogn boundary for any algorithm.