Simple SNARKs for Local Proving
Modern ZK SNARK design has become increasingly modular, flexible, and complex, in order to squeeze out server-side performance for scaling applications. This complexity poses security risks, and yet is still insufficient for generating proofs locally on consumer hardware. Jim from Irreducible, the team leading R&D of Binius, presents new work on simpler SNARKS optimized for local proving, and the benefits of binary field-based constructions.