We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
add benchmarks for different parameters and measure the absolute and relative times of Eval and Verify
Eval
Verify
If possible, compare it to: https://github.com/harmony-one/vdf https://github.com/poanetwork/vdf
The text was updated successfully, but these errors were encountered:
How performant does one expect the library to be compared to, say Sundersoft, which won the Chia networks competition?
Sorry, something went wrong.
This is a good question!
Overall I would assume the code will be slower than Sundersoft, but :
This is a good question! The foundations of this library are built using Pari which is optimised c code for class group operations However, I suspect that our translation from/to Pari to/from our GMP bigint is not so efficient. BigInt operations are suppose to be reasonably efficient. Overall I would assume the code will be slower than Sundersoft, but : probably within same order of magnitude specifically for VDF, the gap quality between generating and solving will be the similar 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
No branches or pull requests
add benchmarks for different parameters and measure the absolute and relative times of
Eval
andVerify
If possible, compare it to:
https://github.com/harmony-one/vdf
https://github.com/poanetwork/vdf
The text was updated successfully, but these errors were encountered: