You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Use benchmarks as in triert/table_test.go to measure overheads:
our counterpart of benchmarkNearestNodes would be benchmarkNearestNodesAsServer, running nearestNodesAsServer instead of nearestNodes. Compare it to the output of benchmarkNearestNodes to evaluate the latency overhead for a single hop for the normalization.
our counterpart of benchmarkChurn would again run nearestNodesAsServer instead of nearestNodes, perhaps rerunning normalization algorithm a lot.
Correctness:
write a test function compare the output of NearestNodesAsServer with respect to NearestNodes. Compute the maximum distance from the queried node, as output by NearestNodes v/s by NearestNodes as server. Compare it to the one in the proof? This would check that as a server node, for only one hop of the peer routing lookup, the output only differs by a certain maximum distance.
Use benchmarks as in triert/table_test.go to measure overheads:
Correctness:
Use simulation directory to test overhead of normalization:
https://github.com/dettanym/private-go-kademlia/tree/private-routing/sim
The text was updated successfully, but these errors were encountered: