  The theory of partition congruences has been a fascinating and difficult
subject for over a century now. In attempting to prove a given congruence
family, multiple possible complications include the genus of the underlying
modular curve, representation difficulties of the associated sequences of
modular functions, and difficulties regarding the piecewise $\ell$-adic
convergence of elements of the associated space of modular functions. However,
our knowledge of the subject has developed substantially and continues to
develop. In this very brief survey, we will discuss the utility of modular
functions in proving partition congruences, both theoretical and computational,
and many of the problems in the subject that are yet to be overcome.
