E-Graphs are a quite interesting tool, and I find them quite exciting, but whenever I hear about people excitedly advocating for them, I can't help but worry that they're not scalable. Asymptotically, these graphs must get enormous if you have a large expression and many rules.<p>Does anyone know of any research into their large-scale performance compared to other approaches to transforming expressions like SSA compilers or symbolic term rewriters?