Just try HTL=1 on a couple of different keys, and wait until you get one fast enough that there is less than .22 (or x) chance that it passed through two nodes (and if you get two keys like that you can say with x? chance that at least one of them was on your node).
The only way to do this safely is to have the wait long enough in comparison to the hoptimes that the number of hops becomes insignificant to the resulting time, and then do some (low) random chance of DNFing at each node. On Fri, Feb 08, 2002 at 08:58:10AM -0500, Tavin Cole wrote: <> > I propose that if the node finds the data for a key in its cache, or if > it's the end node in the chain, it ALWAYS waits one hop time (chosen > randomly within the statistically correct range) before sending the > DataReply or InsertReply/DataNotFound. > > -tc -- Oskar Sandberg oskar at freenetproject.org _______________________________________________ Devl mailing list Devl at freenetproject.org http://lists.freenetproject.org/mailman/listinfo/devl
