accelerating-discrete-program-search-with-sup-nodes
SupGen is about computation sharing: enumerate all candidate programs, but use SUP nodes (superpositions from interaction combinators) to fuse them into a single superposed computation. Instead of running N programs separately, you run one “superposed program” that shares all the intermediate work between candidates. The speedup comes from structural redundancy between programs, not from smarter scheduling.