On Monday 15 Sep 2003 17:11, Todd Walton wrote: > On Sun, 14 Sep 2003, Lorrin Nelson wrote: > > But would anyone ever find anything on the read-only node? Say I've got > > 200 items on the read-only note (ie, a couple moderate-sized websites). > > Chances are there will be no similarity between the CHKs of those items. > > Good point. I was thinking routing keys for the data would be similar. > But, if they're all different, which is very likely to be the case, then > it would be extremely difficult for any node to be able to assimilate the > read only node into its routing table.
How many bits from the key are required for the "specialisation"? If this number is not too high, it is possible that the data could be padded in order to generate different keys. Then when all the keys fit a certain specialisation (hash to values that start with the same bits), the data can be inserted and automatically have a reasonably narrow specialisation. I suspect, however, that this wouldn't work because the specialisation would require rather a lot of matching bits, as this would otherwise open the door for rather nasty flood-type DoS attack on specific nodes or specific parts of the key space. Plus, if it were possible, it is especially this type of deliberately specialised node and it's neighbours that would be worst affected. Gordan _______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
