What is the most efficient way to prove that a person computed r rounds of some cryptographic hash function (ex. sha256) on an input?. The trivial solution seems to be to show all r hashes, where value_i = hash(value_(i-1)) /forall i <= r, but this seems very space inefficient.


closed as off-topic by D.W. Jul 3 '17 at 1:10

  • This question does not appear to be about computer science within the scope defined in the help center.
If this question can be reworded to fit the rules in the help center, please edit the question.