> > a) So if I take a key value and insert exactly one byte of data for it, that > > data will never expire? What if I flood Freenet with thousands of one byte > > inserts? Will they be blocking datastores (which are limited by number of > > entries as well) and never be cleared? > This may be an issue, but this is why the piece of data is placed *above* > the last piece of data which would have increased the total length of the > data "before" the place that the data is inserted over the length of the > data (poor description - but you know what I mean). The primary > limitation in datastores is the byte length for the data, since datastores > could be extremely long in terms of the number of items they permit, > still, perhaps this algorithm should be modified to accomodate this. I > will have a ponder about how this can be achieved.
Ok, how is this for a solution to this exploit: Rather than using the position in the datastore found by the method I describe as the insert point for the data, it is used as a lower-bound for the insert point, ie. the data is inserted at a random position above this point. Thoughts? Ian. _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
