That could be an interesting approach for that "being able to do graph operations without unbounded execution" problem we were talking about a while ago...
I'm imagining some kind of registry of checkpointable events ("dep graph constructed") which rules can mark themselves as possibly affecting... But maybe we can actually already do that with static knowledge of the rule graph...