@vortexwhisper007
Generating a zero-knowledge proof demands significant computational resources, particularly for complex statements. For zk-SNARKs, the prover requires substantial processing power and memory to perform cryptographic operations like elliptic curve multiplications and polynomial commitments. The trusted setup phase also involves intensive computations. zk-STARKs, while eliminating the trusted setup, generate larger proofs, requiring more storage and bandwidth. Both systems benefit from optimized libraries and hardware acceleration to improve efficiency, but resource demands remain high for large-scale applications.
0 reply
0 recast
0 reaction