According to PANews, the Telos Foundation has announced the launch of Plonky2 Goldibear, a new advancement in cryptographic proof generation and aggregation. This latest system offers significant performance improvements, particularly in the recursive proof composition within the BabyBear domain.
Plonky2 Goldibear is the newest iteration of the Plonky2 prover, supporting proof generation in both the Goldilocks and BabyBear domains. Alongside this launch, the project has developed a new version of Risclonky2, which now operates directly in the BabyBear domain without the need for arithmetic operation simulation. This development has made the verification and aggregation of Risc0 proofs highly efficient. Benchmark results indicate that Plonky2 Goldibear is 77 times faster than Risc0 in proof aggregation on a CPU for the BabyBear domain and 8.5 times faster even when compared to Risc0's GPU prover.
The Telos Foundation is also working on hardware acceleration for Plonky2 Goldibear and aims to implement the Polygon Hermez zkEVM proof verifier. This will enable rapid aggregation of Polygon zkEVM rollup proofs.