Why can't there be cycles in the Merkle graph
That would be cool. You just have a partial order between children and parents, like in git.
That would be cool. You just have a partial order between children and parents, like in git.
Can you summarizd how the actual algorithm is supposed to work, ie its main ideas?
I am surprised to find that using sha hashes in a tree or DAG will leak information to people who shouldn't have it. Is this a serious flaw and how do these guys ultimately solve the problem? I read the paper but the algorithm seems a bit hard to understand and follow.
To do that, you need to generate a collision. You enter a random content hash in the document, then keep modifying the document and hashing it untill it's hash matches the one you included. It's not impossible, but depending on the hash function, it may take you a very long while to find it.