Join GitHub today
GitHub is home to over 36 million developers working together to host and review code, manage projects, and build software together.Sign up
Speeding up computation of Pedersen hashes #107
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.
One possibility is applying the strategy described here https://doc-internal.dalek.rs/curve25519_dalek/backend/avx2/index.html to JubJub