The most underrated insight about logarithms is that for almost all practical applications, log2(n) is smaller than 32.

The difference between a O(1) and O(log n) algorithm is usually not that big!