On some questions about minimal log discrepancies

The minimal log discrepancy is a measure of singularities of pairs. While akin to the log canonical threshold, it turns out to be much more difficult to study, with many questions still open. I will discuss a question about the boundedness of divisors that compute the minimal log discrepancy on a fixed germ. This is joint work (in progress) with Yusuke Nakamura.