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
Fixing VDF prover for high difficulty #126
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks for your catch and your contribution!
Co-authored-by: Arvid Norberg <arvid.norberg@gmail.com>
Co-authored-by: Arvid Norberg <arvid.norberg@gmail.com>
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
lgtm
for (uint64_t i = 0; i < num_iterations; i++) { | ||
if (i % kl == 0) { | ||
uint64_t index = i / kl; | ||
intermediates.at(index) = y; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
using at()
here will slow this down.
here's a somewhat tweaked and signed version of this patch: #132 |
VDFs with difficulty higher than INT_MAX (2147483647) fail even if the difficulty is set as a double. This is because of a int loop on the difficulty in the prover_slow.h file.
Linked to issue #125