One question. I know that its nearly impossible to reverse a good hash or to create a doc that will knowingly return the same hash. So PREDICTING a collision (finding a doc that will collide with a given doc) is very very very difficult. But Due to the size of the output and input space we know for a fact that collisions do exist (right?) So if a very large number of documents are timestamped using this, their hashes WILL collide right? I mean there is a POSSIBILITY that you may find proof for a doc that wasn't actually stored here, right?
(Just wondering. Not throwing criticism. I actually LOVE this idea!)
Comments
One question. I know that its nearly impossible to reverse a good hash or to create a doc that will knowingly return the same hash. So PREDICTING a collision (finding a doc that will collide with a given doc) is very very very difficult. But Due to the size of the output and input space we know for a fact that collisions do exist (right?) So if a very large number of documents are timestamped using this, their hashes WILL collide right? I mean there is a POSSIBILITY that you may find proof for a doc that wasn't actually stored here, right?
(Just wondering. Not throwing criticism. I actually LOVE this idea!)