Highlights
The Sum-Check Protocol w/ Justin Thaler
In this module, Tracy Livengood and Justin Thaler provide a comprehensive introduction to the sum-check protocol and why it is so powerful, beginning with a catch-up on polynomials (univariate, multivariate, multilinear) as well as the important concept of multilinear extensions, and introduce the “equality” function. They go on to explain the mechanics of the sum-check protocol, detailing its goals and process, before walking us through the rounds of the protocol and demonstrating how it is applied. They then highlight the advantages of sum-check over other SNARK systems, and sketch the Spartan polynomial IOP. Toward the end, they delve into the Goldwasser, Kalai and Rothblum (GKR) protocol and discuss the trade-offs between this system and Spartan.
Deep dive into Circle-STARKs FFT
@ignaciohagopian wrote an article explaining the rationale and the mechanics of the specific fast Fourier transform (FFT) defined in the Circle STARKs paper.
Possible futures of the Ethereum protocol, part 1: The Merge
Possible futures for the Ethereum protocol, part 2: The Surge
Vac 101: Transforming an Interactive Protocol to a Noninteractive Argument
Intro To Math Proofs (Full Course)
A library for lattice-based multiparty homomorphic encryption in Go
Updates
Plonky3 has gotten 2-4x faster, with M3 Max now proving ~1.7 million Poseidon2 hashes per second.
Overview of Circle STARKs
Proof is in the Pudding 02: zkTLS
ZK12: ZK on Bitcoin - Liam Eagen
ZK12: Myth vs. Reality: Enhancing Proving Time in KZG-Backed Plonkish Systems for zkWASM - Sinka Gao
House of ZK - Virtual Conference 1.0
Interview with Eli Ben-Sasson - HoZK Virtual Conference 1.0
ZK-SecreC
Open sourced ZK-SecreC, a zero knowledge toolkit for building large proofs on computation. Imagine proving to someone that your health records don't have a diagnosis or that you have been staying in some are without leaking the source data.
On Distributed FRI-based Proof Generation
Papers
Glacius: Threshold Schnorr Signatures from DDH with Full Adaptive Security
Sparrow: Space-Efficient zkSNARK for Data-Parallel Circuits and Applications to Zero-Knowledge Decision Trees
RPO-M31 and XHash-M31: Efficient Hash Functions for Circle STARKs
Fiat-Shamir Goes Rational
Curve Forests: Transparent Zero-Knowledge Set Membership with Batching and Strong Security
One-Shot Native Proofs of Non-Native Operations in Incrementally Verifiable Computations
Compressed $\Sigma$-protocol Theory from Sum-check
Instance Compression, Revisited
zkFFT: Extending Halo2 with Vector Commitments & More
A Hidden-Bits Approach to Black-Box Statistical ZAPs from LWE
Consensus on SNARK pre-processed circuit polynomials
Multi-party Setup Ceremony for Generating Tokamak zk-SNARK Parameters
Batch Range Proof: How to Make Threshold ECDSA More Efficient
Blind zkSNARKs for Private Proof Delegation and Verifiable Computation over Encrypted Data
GAPP: Generic Aggregation of Polynomial Protocols
On pairing-friendly 2-cycles and SNARK-friendly 2-chains of elliptic curves containing a curve from a prime-order family
Computational Analysis of Plausibly Post-Quantum-Secure Recursive Arguments of Knowledge
If you’d like to receive updates via email, click subscribe. Stay informed and never miss a post!
And our YouTube channel