Intuitively, the information gain to a k times narrower uniform distribution contains log 2 ⁡ ⁡ k bits. This connects with the use of bits in computing, where log 2 ⁡ ⁡ k bits would be needed to identify one element of a k long stream.