Multiplies polynomials together using an FFT
This library efficiently multiplies polynomials using FFT, supporting both real and complex coefficients, with a time complexity of O((a.length + b.length) * log(a.length + b.length)). It's designed for developers working with numerical computations in JavaScript who need fast polynomial multiplication, particularly those using Node.js or browser-based applications that require scientific computing capabilities.
How the donated funds are distributed
Kivach works on the Obyte network, and therefore you can track all donations.