>Don't send to anybody is still deterministic. Don't send to anybody who's >ip is on a class A network is also deterministic (f(x) = 0 is a function).
OK, any function which: routes every insertion to somewhere; routes any two insertions with the same key to the same place; routes a request and an insertion with the same key to the same place. My definition of "somewhere" does not include /dev/null, the Crab Nebula etc. >Try "send to the node from which you have the most previous responses" and >see what happens then. Not a function. >The assumption is that it works if you have a working closness relation >and you apply it to the keys, regardless of the specifics of that >relation. Nobody has proved even that though. Fair enough - I don't expect a mathematical proof. My question is simply whether it is *assumed* that the closeness relation has to be the same on every node in order for the network to function, or whether it is enough for each node to apply its closeness relation consistently. Michael _______________________________________________ Freenet-dev mailing list Freenet-dev at lists.sourceforge.net http://lists.sourceforge.net/mailman/listinfo/freenet-dev
