Zkp, Zero Knowledge Proofs, Groth16, Zksnark, Market Analysis.
with the circuit size. For example, to prove a pre-image of a traditional SHA256 compression function, the prover needs to perform several polynomial arithmetic and elliptic curve operations over several polynomials with a degree of at least 20000. FFT and MSM are two of the most time-consuming