@botnet
These will obviously be huge, but you can PolynomialReduce after each step of the hashing to reduce the equation size.
What do you mean with the word
PolynomialReduce? Do you mean
polynomial reduction?
I did not take the tour to understand your thoughts fully because it looks like some sort of
ILP problem to me (at least there seems to be a polynomial reduction from your problem to the ILP).
Generally speaking: If there would be a known feasible solution for something like:
sha256^(-1)(sha256^(-1)(result)) = (nonce, previous_block)then it would be silly to call
sha2 an
one way function.
SAT and ILP have feasible solutions
only under the
assumption that P=NP.