> If the various combinations of parts which add up to a whole document are > stored under rotations of the same text key, as suggested, maybe client > writers could be persuaded to rotate the text key through a random number of > steps before hashing it? This wouldn't increase the bandwidth required > (except in the case of repeat requests), but it would ensure that all parts > were requested an equal number of times.
This would help, but recall that the more times a piece of data is requested, the more available it will be in Freenet. Spreading requests among a larger number of pieces of data, even if spread evenly, will result in fewer requests for each individual piece of data, making it more likely that they will be lost in Freenet, and counteracting any benefits gained from using a fault tolerant splitting mechanism. Ian. _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
