On Mon, May 28, 2001 at 06:02:42PM -0700, Ian Clarke wrote: > On Mon, May 28, 2001 at 12:45:26AM -0400, Tavin Cole wrote: > > > Perhaps, but the node would basically fail on every request, except in > > > the unlikely event that it receives a request for the data in which it > > > wants to specialise - it would be a lottery. > > > > Nah, it could employ a "drifting" algorithm and nudge its keyspace > > over time. > > This may be possible, but it is hardly "trivially easy".
Possible == trivially easy The truth is I don't think the network is well ordered enough for this to work very well (again more than deserved confidence is granted to the efficiency of the algorithm), but it has been something I have wanted to test for a long time. Obviously, there are other ways of trying to find a keyspace though, for example you can keep announcing new nodes until it randomly hits close enough. -- 'DeCSS would be fine. Where is it?' 'Here,' Montag touched his head. 'Ah,' Granger smiled and nodded. Oskar Sandberg oskar at freenetproject.org _______________________________________________ Devl mailing list Devl at freenetproject.org http://lists.freenetproject.org/mailman/listinfo/devl
