Is it mathematically possible to adapt a given hash function (f.e. SHA-1 or MD5) so it performs a known number of iterations at once?
Concrete example would be:
data = SHA1_10000(data)
for (i = 0; i < 10000; i++) data = SHA1(data)
while resulting in the same output, but being 10000 times faster.