Mike writes: > The cpu load of all these CHK generations is the only thing that may be > a problem if the CH algorithm is too complex. However, it doesn't need > to be overly complex since more uniqueness will be provided by hashing > it wil the KHK. Also, generating the hash once on insert and then having > sentry nodes verify the hash should ease some of the load.
One thing I didn't understand in your description was whether you need to index under Hash(CHK:KHK). Why not just store CHK and KHK with each entry in the node's data store. Then when you get a KHK it is quick and easy to go down each entry and check for a match, you don't have to compute a hash for each entry. Hal _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
