The two articles introduce Ligero-Binius and FRI-Binius zero-knowledge proof systems, discussing their polynomial commitment schemes, efficiency improvements, recursive verification optimizations, and potential for hardware acceleration.
The article explores computer-assisted mathematical research, covering applications of machine learning, formal proof assistants, and large language models, highlighting their current potential, challenges, and integration for future advancements in mathematics.
A proof-of-concept implementation of the LatticeFold folding scheme engineered by Nethermind based on the work LatticeFold: A Lattice-based Folding Scheme and its Applications to Succinct Proof Systems by Dan Boneh and Binyi Chen.
MyZKP is a Rust implementation of zero-knowledge protocols built entirely from scratch! This project serves as an educational resource for understanding and working with zero-knowledge proofs.
They go on to discuss the challenges facing the ecosystem. And they wrap with a brief look forward, covering what to expect in ZK in 2025.
Explored using HE for coSNARKs by adapting HElib. Despite getting optimizations to work, FFTs in HE are still 10,000 times slower than plain or MPC and need huge memory.
If you’d like to receive updates via email, subscribe us!
