These two facts are simultaneously true about the MST problem:

1. We know of a deterministic algorithm to solve it with an optimal asymptotic runtime.
2. We don't know the best possible asymptotic runtime for solving it deterministically.

Sometimes, you can prove something is optimal without knowing how long it takes. It's a fun quirk of CS.

en.wikipedia.org/wiki/Minimum_spanning_tree#Optimal_algorithm