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

Speeding up computation of Pedersen hashes #107

Open
nicola opened this issue Apr 2, 2019 · 1 comment

Comments

Projects
None yet
2 participants
@nicola
Copy link
Contributor

commented Apr 2, 2019

We use the JubJub Pedersen hash to generate the Merkle trees in Filecoin. The computation of these hashes is slow and CPU-intensive (~200 times slower than blake2s). Reducing the cost of computing Pedersen hashes will reduce the operating costs of mining in Filecoin. Are there cost effective ways to speed up Pedersen hash computation?

The output of this work an improvement to the Bellman Pedersen hash algorithm (implemented here). Amongst possible solutions: GPU programming, SIMD optimizations, FPGA.

@dignifiedquire

This comment has been minimized.

Copy link
Member

commented Apr 2, 2019

One possibility is applying the strategy described here https://doc-internal.dalek.rs/curve25519_dalek/backend/avx2/index.html to JubJub

@nicola nicola changed the title Speeding up computation of pedersen hashes Speeding up computation of Pedersen hashes Apr 3, 2019

@nicola nicola added proofs and removed proofs labels Apr 3, 2019

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.