In this talk, we seek to demonstrate how the problems of optimization, bug-finding, and repair can be unified in a single e-graph-based framework, and show how this works with Egg and its explanations functionality. As with typical rewriting-based approaches, our framework takes advantage of the semantics-preserving rewrite rules a user may already know about, but we also leverage non-semantics-preserving rewrite rules. The talk will propose lightweight extensions to the e-graph data structure and explanations mechanism to natively support a high-performance version of our framework. Our current prototype shows promising results, and we would welcome discussion and feedback from the e-graphs community.