Hi friends! I’m back to uploading my Algebraic & Complex Geometry course online. I was busy starting my postdoc at Harvard so there was a gap. This summer I’ll be posting the rest of the course. Here’s the latest lecture:
https://t.co/0eXhlxi6lQ
We have verified the security of the Fast Reed–Solomon Interactive Oracle Proof (FRI) protocol - a cornerstone of modern transparent, STARK-style zero-knowledge proofs - by autoformalizing "Succinct Proofs and Linear Algebra" by Evans-Angeris with Gauss.
https://t.co/btyAi8SKIx
Excited to share https://t.co/PhHBgrv7Eo, which rethinks the usage of folding in succinct proof systems.
We provide a new framework to build folding-based SNARKs, by eliminating the need to prove Fiat-Shamir inside circuits and by introducing a high-arity lattice folding scheme
Excited to share our new paper: https://t.co/EIsfIsZAW4! We made Groth16 dynamic - proofs can now be efficiently updated when the witness changes slightly. Amazing that after 10 years, we still have new insights of Groth16 and Pinocchio. Joint work with two brilliant new students
Glock (🔫💥) paper + code has dropped!
- 99.8% reduction in on-chain costs over BitVM2.
- 100x reduction in off-chain costs over BitVM3.
@liameagen and rest of @AlpenLabs Research are legends.
[New] Collaborative zkSNARKs with Sublinear Prover Time and Constant Proof Size (Zhiyong Fang and Sanjam Garg and Bhaskar Roberts and Wenxuan Wu and Yupeng Zhang) https://t.co/056Rw0pwSt
[New] Fast AVX-512 Implementation of the Optimal Ate Pairing on BLS12-381 (Hao Cheng and Georgios Fotiadis and Johann Groschdl and Daniel Page) https://t.co/M7QwQwFdma