We study the capacity of the range of a simple random walk in three and higher dimensions. It is known that the order of the capacity of the random walk range in n dimensions is similar to that of the volume of the random walk range in n-2 dimensions. We show that this correspondence breaks down for the law of the iterated logarithm for the capacity of the random walk range in three dimensions. We also prove the law of the iterated logarithm in higher dimensions. This is joint work with Amir Dembo.