I have a idea about insertion verification. I am not sure whether it will work or not but here goes:
Whenever a node receives a insertion, it will pass it on and sign it. It then passes back the signatures of its peers down the chain as well as it own signature. For example: A->B->C->D D will give to C its signature and C will give B the signature of D as well as it's own and so on. A will receive the signatures of B, C, and D. Of course, B can fake those identities. To prevent that, A trusts the validity of those signatures porportional to their rep. If the rep of C and D are high, then B probably did insert those files. If the rep of C and D were low though, B probably faked those identities. Would this work? What do you guys think? __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com
