I had to adopt various other interesting techniques(AI assisted) too like folding 256-bit digest region to one scalar and checking computed rootโs two 128-bit words against storage root via a single random-combined sumcheck which binds the whole proof in a single opening.
Introducing Flock: a new SNARK for proving batches of standard hash functions at just 250ร the cost of computing them natively.
Developed by @benediktbuenz from @EspressoSys, @ronrothblum, and NYU's William Wang, Flock puts Ethereum's Post Quantum target in reach.
this part of the Coinbase paper is misleading: many people understood it as "ZK proofs are post-quantum", which is false; here they talk of the zero-knowledge property, but SOUNDNESS is at least as important and is often not PQ (relying on discrete log-related assumptions); STARKs are an exception
welcome PlasmaBlind: a new privacy L2 that ditches SNARKs altogether, with <100ms client-side zk proofs, using the blindfold scheme and a carefully designed aggregator.
uncompromising and instant privacy on *any* device.
we implemented and benchmarked the whole thing at @PrivacyEthereum and are opening it under MIT.
paper + code available at https://t.co/nW2kMCT50p
the time for a special purpose privacy L2 has come ๐
ZK proofs are headed for real-world deployment โ but writing correct ZK statements is tricky.
Our new post introduces zkLean, a Lean library that defines a domain specific language for specifying and formally verifying ZK statements.
Read more: https://t.co/6eWh3IHWK3