We investigate the minimal local time $f(n)$ of a one-dimensional simple random walk up to time $n$, defined as the smallest number of visits to any site in the range. A conjecture formulated repeatedly by Erdős and Révész (1987, 1991) stated that $\limsup_{n\to\infty}f(n)=2$ almost surely, which was disproved by Tóth (1996) who showed $\limsup_{n\to\infty}f(n)=\infty$. Subsequently, Révész (2013) suggested studying the growth rate and established an upper bound of the order $\log n$. In this paper, we determine the precise asymptotic growth rate, proving that with probability one, $$ \limsup_{n\to\infty}\frac{f(n)}{\log\log n}=\frac{1}{\log 2}. $$ This result answers the open question posed in Section 13.2 of Révész (2013).