On Mon, 07 Aug 2000, Ian Clarke wrote: <> > 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.
This might help some, but I'm still worried that uselessly small data will provide a good way to choke up the datastores. I think you should at least implement some lowest size threshhold, say 50 kB, so that all data smaller then that is counted as having that size for this method. > > Thoughts? > > Ian. > > _______________________________________________ > Freenet-dev mailing list > Freenet-dev at lists.sourceforge.net > http://lists.sourceforge.net/mailman/listinfo/freenet-dev -- \oskar _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
