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

benchmarks for VDF #29

Open
omershlo opened this issue Dec 1, 2019 · 3 comments
Open

benchmarks for VDF #29

omershlo opened this issue Dec 1, 2019 · 3 comments
Labels
good first issue Good for newcomers help wanted Extra attention is needed

Comments

@omershlo
Copy link
Contributor

omershlo commented Dec 1, 2019

add benchmarks for different parameters and measure the absolute and relative times of Eval and Verify

If possible, compare it to:
https://github.com/harmony-one/vdf
https://github.com/poanetwork/vdf

@omershlo omershlo added help wanted Extra attention is needed good first issue Good for newcomers labels Dec 1, 2019
@jon-chuang
Copy link

How performant does one expect the library to be compared to, say Sundersoft, which won the Chia networks competition?

@omershlo
Copy link
Contributor Author

This is a good question!

  1. The foundations of this library are built using Pari which is optimised c code for class group operations
  2. However, I suspect that our translation from/to Pari to/from our GMP bigint is not so efficient.
  3. BigInt operations are suppose to be reasonably efficient.

Overall I would assume the code will be slower than Sundersoft, but :

  1. probably within same order of magnitude
  2. specifically for VDF, the gap quality between generating and solving will be the similar
  3. There is a LOT of room for improvement in this library

@0xmountaintop
Copy link
Contributor

This is a good question!

  1. The foundations of this library are built using Pari which is optimised c code for class group operations
  2. However, I suspect that our translation from/to Pari to/from our GMP bigint is not so efficient.
  3. BigInt operations are suppose to be reasonably efficient.

Overall I would assume the code will be slower than Sundersoft, but :

  1. probably within same order of magnitude
  2. specifically for VDF, the gap quality between generating and solving will be the similar
  3. There is a LOT of room for improvement in this library

poanetwork also has this discussion: poanetwork/vdf#13

MPIR may be a better choice over GMP & Pari

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
good first issue Good for newcomers help wanted Extra attention is needed
Projects
None yet
Development

No branches or pull requests

3 participants