We introduce a new equality saturation algorithm that efficiently optimizes terms available at different points in time using a single (incremental) e-graph, thereby extending the structure sharing benefits of standard equality saturation temporally.