hal at finney.org wrote: > I've looked some more at Oskar's announcement protocol, > http://cvs.sourceforge.net/cgi-bin/cvsweb.cgi/~checkout~/docs/announcement.txt?rev=1.1&content-type=text/plain&cvsroot=freenet > > As far as I can see, the protocol is cryptographically sound. I have > two concerns, which don't deal with any cryptographic problems. > > The first is whether this protocol will "work" in the context > of Freenet routing. The problem is that a new node gets an initial > keyspace assignment, but this is announced to a _random_ set of nodes. > This is unlike the usual Freenet situation where nodes tend to be known > to other nodes which are similar in keyspace.
A priori it seems like it might be a problem, but in practice when I did simulations it seemed to work well enough. Certainly it's a huge improvement over inform.php -- the inform-style announcement really broke down over 10,000 nodes, and no tweaks I tried could get it any higher, whereas the random announcement sailed up to 250,000 nodes (when I ran out of memory). There could be two reasons for this: first, the nodes aren't entirely random, they are still linked to one another, although perhaps not by the keys you would ideally like; second, the insert mechanism is still operating. Also, for Alice's own purposes, it seems she would rather get references to a random set of nodes than a closely related group, so that she has more choice in routing her own requests. However, if you can think of a way to announce to a related group of Bobs, we can certainly test to see which one works better. theo _______________________________________________ Devl mailing list Devl at freenetproject.org http://www.uprizer.com/mailman/listinfo/devl
