Parallelizing the recursive fourier transform function

[tjsturos]

The Rust BLS48581 package implements a Discrete Fourier Transform for proving and making commitments.

This could be optimized further to be parallelized for more efficient computing, considering it is a divide and conquer type algorithm.

https://github.com/QuilibriumNetwork/ceremonyclient/blob/f640c09008c80d769a2587e64e5180f5f2efa406/crates/bls48581/src/lib.rs#L154

This would provide immense value to the network.