personaelabs/shockwave-plus

Field-agnostic proof systems provide efficient proving by allowing native-field arithmetic. This property is significant for client-side programmable signatures, zkEVMs, and various other scenarios where proof of statements about primitives traditionally considered "zk-unfriendly" is required. We aim to build a zero-knowledge proof system that is field-agnostic, efficient, and effortlessly composable with a SNARK with 𝑂 ( 1 ) proof size (e.g. Groth16, PLONK) to achieve minimal verification complexity. Shockwave is a variant of Brakedown that uses Reed-Solomon code instead of a linear-time encodable code. Brakedown has a linear-time prover and is field-agnostic (i.e. works over all finite fields), but its proofs are concretely larger than Shockwave’s. Shockwave provides shorter proofs and lower verification time but requires an FFT-friendly field to achieve 𝑂 ( 𝑛 log ⁡ 𝑛 ) proving time. Shockwave+ is an extension of Shockwave that works over all finite fields by using ECFFT inst

Field-agnostic proof systems provide efficient proving by allowing native-field arithmetic. This property is significant for client-side programmable signatures, zkEVMs, and various other scenarios where proof of statements about primitives traditionally considered "zk-unfriendly" is required. We aim to build a zero-knowledge proof system that is field-agnostic, efficient, and effortlessly composable with a SNARK with 𝑂 ( 1 ) proof size (e.g. Groth16, PLONK) to achieve minimal verification complexity. Shockwave is a variant of Brakedown that uses Reed-Solomon code instead of a linear-time enc