The easiest way to handle that I think would be to start with rank 1 until complete, retrieve the second, etc... in series not parallel at least for a period of uptime.
On Mar 31, 2010 9:16 AM, "Evan Daniel" <evanbd at gmail.com> wrote: On Wed, Mar 31, 2010 at 5:42 AM, xor <xor at gmx.li> wrote: > On Wednesday 31 March 2010 06:32:58 am Ev... Please don't misunderstand: right now I think usability and any internal changes you need to do to get WoT / FT ready for release are far higher priority. I'm greatly appreciative for the work you've been doing, and think you should keep doing it. There's time enough for WoT algorithms after that. > >> Retrieving trust lists for large numbers of nodes should scale fairly >> well, as long as the ... Hmm? You mean limiting it to 2 degrees of separation? Doesn't that mean a lot of the network isn't visible (especially if you're assuming lots of new users)? I already have a lot of known rank 3 identities. (Also, I don't see how that's O(log(n)) -- it sounds more like O(1) to me.) Evan Daniel _______________________________________________ Devl mailing list Devl at freenetproject.o... -------------- next part -------------- An HTML attachment was scrubbed... URL: <https://emu.freenetproject.org/pipermail/devl/attachments/20100331/f1368ed4/attachment.html>
