I guess one counter argument is lossy compression. Another argument is to think about how rng generators are constructed in some cases (algebraic curves) and im

I guess one counter argument is lossy compression. Another argument is to think about how rng generators are constructed in some cases (algebraic curves) and imagine instead of finding a seed, solving for an algebraic curve with the desired properties. More data necessary (the curve data) and tons of compute still (solving multivariate polynomials) but less so than finding a seed. Then there’s also ideas like creating the weights out of another network (basically moving around in that sub space) which is a much more feasible idea and something Hardmaru has a cool article about