My previous proposal was dynamic estimators, but it would be slow to compensate and hard to implement. Forget I mentioned it :) Also, I'd like to add a third item to my list:
3) Tom's decentralized positive trust biased model - solves the DoS problem and is much more usefull for solving other freenet trust issues, but will be hard to implement. Tom's decentralized positive trust biased model --- "Edward J. Huff" <[EMAIL PROTECTED]> wrote: > How does 2) differ from your last proposal? > > BTW a good random 1-1 function simply rearranges the > bits in the key according to a permutation of the > integers 1 .. keyLength. There are keyLength! such > permutations, and how to pick one at random so that > they are all equally likely is well known (but I > don't > remember exactly how to do it). > > -- Ed Huff > > __________________________________ Do you Yahoo!? Exclusive Video Premiere - Britney Spears http://launch.yahoo.com/promos/britneyspears/ _______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
