Matthew Toseland writes: > Awesome! We need to: > 1) Implement this.
Yepp. > 2) Publish it. We should… Stefanie and Michael might be able to gain something from that. Maybe you, too? > Why is reinserting the whole datastore important in the case of an attack? Because in normal swapping, as soon as the network settled a bit, the changes in location should be small (though my nodestats look different: too large changes in location for my taste…). So the node data should still be reachable. When randomizing the position, however, the step is large and the node might settle into a new part of the keyspace, so the store might not be reachable anymore. > AFAICS we are looking for a gap much larger than the node's local > average peer distance? In practice this is likely to vary a lot because > of different node degrees etc? Yes. Node degree is the core variable for that. Thanks to FOAF information we should be able to use an average degree of all friends for the calculation. > On opennet, performance has a big impact; > on darknet, a node's location on the graph and its peer count? I'm > thinking of the problems we had around the time Pitch Black was > published - at least some of it was due to nodes with few peers taking > locations in big gaps and then leaving the network. We can’t keep nodes from leaving, but we can keep swapping which spans large parts of the keyspace from making parts of the datastore inaccessible. Best wishes, Arne -- Unpolitisch sein heißt politisch sein ohne es zu merken
signature.asc
Description: PGP signature
_______________________________________________ Devl mailing list [email protected] https://emu.freenetproject.org/cgi-bin/mailman/listinfo/devl
