search

filecoin-project / research

Home for Filecoin Research
Other
74 stars 10 forks source link

Speeding up computation of Pedersen hashes #107

Closed nicola closed 4 years ago

nicola commented 5 years ago

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 commented 5 years ago

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

nicola commented 4 years ago

old issue, closing