2026/05/18 by Qiantan Hong, Rupanshu Soi, Yihong Zhang +1 · 1 voice
Computer Science · #cs.PL
paper · pdf · doi:10.48550/arxiv.2605.19005
arxiv published 2026/05/18 · arxiv updated 2026/05/22
Equality saturation has become a dominant paradigm for equational program optimization. However, it has never been rigorously compared to another approach to the same problem, even though several exist, the most notable being stochastic search. In this paper, we compare equality saturation to stochastic search over five benchmarks to answer the question: are e-graphs actually good?