Some functions are not touched by the binary transformation. It would speed things up to special case easily detectable complete function equality.

Keep an eye out for whether syntactically equal prefixes, suffixes, or internals of programs can be cut in some way. Unclear if this is possible.