This article will explore the application of pipeline-based generation of zero-knowledge proofs in zkRollup.

The degree of computational delegation of the zero-knowledge proof algorithm used in zkRollup needs to be carefully designed, and it must be just right to achieve optimal overall efficiency. The FOAKS algorithm implements adjustable computational delegation through its own iterative recursion and is specifically designed as a zero-knowledge proof algorithm for zkRollup.

The "small table mode" zkEVM not only ensures that native Solidity Ethereum developers can seamlessly migrate to zkEVM, but also significantly reduces the redundant costs incurred when encapsulating EVM into the ZK proof system.

This article introduces how FOX uses the classic Fiat-Shamir heuristic to generate challenges in Brakedown, thereby implementing the process of a non-interactive protocol.

Brakedown, although it has a larger Proof Size, is undoubtedly the fastest polynomial commitment protocol available today.

To avoid falling into the awkward situation of "insufficient algorithms compensated by hardware," the problem should be addressed from the essence of the algorithm.