Hi @llb !

Thanks for seminar, so great it brought me back to Masto :O

I was wondering, do you think there would be potential in exposing ~all possible minifications (as an [E-Graph]) and automatically search for the one that minimizes post-compression output ?

If the compressor itself is modeled (either approximately or outright integrated with) one can be much faster than bruteforce: superoptimizers do that, would be unpractical otherwise

[E-Graph]: https://en.wikipedia.org/wiki/E-graph