In the field of privacy computing, I recently saw a project that has made significant optimizations on the zk-SNARKs algorithm. The core improvements focus on two directions: first, enhancing efficiency, and second, reducing costs.

How exactly is this achieved? By simplifying circuit design, proof generation time can be shortened by 35%, and verification time by 28%. This level of improvement is quite noticeable. More interestingly, the new version supports batch transaction proof generation—100 privacy transactions can be combined into a single proof for processing, directly reducing Gas fees and effectively optimizing user costs.

Currently, the algorithm is running on the testnet, and it is expected to be fully deployed by the mainnet upgrade in 2026. This will further improve the practical usability of privacy transactions, ensuring privacy is protected while also keeping efficiency and costs in check. In summary, this is the real direction where privacy computing can truly find its application.