Comment by _alternator_

So the proofs I’m most familiar with embed programs as polynomials over finite fields. Input data also corresponds to choosing some coefficients, and if you can choose enough coefficients (enough to embed the hash function) then the attack may be feasible.

The problem is compounded because the hash functions are typically chosen to have extremely short polynomial representations.