If doubling builds the tower, the logarithm measures it: log₂ asks ‘how many doublings?’ — and log₂(2048) = 11, the exact height of this corpus. Its magic trick, the one that powered slide rules for centuries: it turns MULTIPLICATION into ADDITION (log ab = log a + log b). It’s why halving a search 11 times finds one item in 2,048, and why so much of computing runs in ‘log time.’ The tower is built by doubling; the logarithm is the ruler that reads it back. Slide to count the halvings home.
The logarithm is the inverse of exponentiation: logₖ(x) is the power to which the base b must be raised to get x, so log₂(2048)=11 — the number of doublings (or halvings) between 1 and 2048, exactly this corpus’s height. Its defining property, log(ab)=log a+log b, converts MULTIPLICATION into ADDITION (the basis of slide rules and log tables for 350 years). In computing it measures divide-and-conquer: [[the-binary-search-tree|binary search]] and balanced trees do ~log₂n work because each step halves the problem — ~11 steps to pin one item among 2048. Doubling raised this tower; the logarithm reads its height back. A fail-loud self-check throws unless log₂(2048)=11 and log turns products into sums. ◆ real, node-verified. — the last of the closing three.
Logs are defined for positive x (log→−∞ as x→0, undefined at/below 0); the base sets the scale (2 here). The inverse-of-doubling and product→sum identities are exact.