From: "Ray Heasman" <[email protected]> > The solution is to limit the percentage of the datastore that can be > affected by reads, as explained further in my reply to Ian on the "Another > possible bug" thread. Essentially you have two datastores, one for caching.
Ok, I see. With your scheme, I see a problem with anonymity of inserts though. If something is inserted with HTL n, it will end up in the non-caching part of exactly n datastores, right? This makes it a lot easier to find out who the original inserter was. If you can see inside one node that received the file during insertion, it is probably possible to find out all or most of the other nodes involved. > I can't get anyone to comment on this proposal though. :-( I just did ;-) -Stefan _______________________________________________ Devl mailing list Devl at freenetproject.org http://lists.freenetproject.org/mailman/listinfo/devl
