im just thinking out loud of a method to prove how many hashes has been calculated for some pow.
for(let i = 1; i < 7; i++)
x = hash(x + nonce + timestampMessage)
}
iter
1 x = hash(1 + 1 + "this text proofs minimum date (information not known before)")
2 x = hash(x + 2 + "this text proofs minimum date (information not known before)")
3 x = hash(x + 3 + "this text proofs minimum date (information not known before)")
4 x = hash(x + 4 + "this text proofs minimum date (information not known before)")
5 x = hash(x + 5 + "this text proofs minimum date (information not known before)")
6 x = hash(x + 6 + "this text proofs minimum date (information not known before)")
iter 6 hash requires hashes from iterations 1-5
iter 1 cannot be made before "minimum date"
question:
can we proof that hash for each nonce from 1 to 6 has been calculated and no steps were skipped?