The idea is to optimize the compiler IR with many small, local graph-rewrite rules (“peepholes”) instead of relying only on big global passes. You inspect a tiny region of the Sea-of-Nodes graph, replace it with a simpler equivalent form, and then reprocess neighboring nodes