Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

evaluating normalization (single hop) #2

Open
3 tasks
dettanym opened this issue Oct 27, 2023 · 0 comments
Open
3 tasks

evaluating normalization (single hop) #2

dettanym opened this issue Oct 27, 2023 · 0 comments
Assignees

Comments

@dettanym
Copy link
Owner

dettanym commented Oct 27, 2023

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 simulation directory to test overhead of normalization:
https://github.com/dettanym/private-go-kademlia/tree/private-routing/sim

@dettanym dettanym changed the title evaluating normalization evaluating normalization (single hop) Oct 27, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants