Zero Knowledge Research
Overview
Here we do a deep dive on Zero Knowledge
- Approach
- Emerging Use Cases
- Proof Systems
- Efficient Signatures
- Proof Aggregation
- Tokenomics
Learning Material
Foundational
Zero Knowledge
- Fraud and Data Availability Proofs: Maximising Light Client Security and Scaling Blockchains with Dishonest Majorities. Light clients, also known as Simple Payment Verification (SPV) clients, are nodes which only download a small portion of the data in a blockchain, and use indirect means to verify that a given chain is valid.
- zkBridge: Trustless Cross-chain Bridges Made Practical
- Caulk: Lookup Arguments in Sublinear Time: position-hiding linkability for vector commitment schemes: one can prove in zero knowledge that one or m values that comprise commitment cm all belong to the vector of size N committed to in C.
- HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates
- SLONK—a simple universal SNARK: a simplification to PLONK called SLONK. We replace the permutation argument (the “P” in PLONK) in favour of a shift argument (the “S” in SLONK). We get a universal SNARK with the smallest known proof size and verification time.
- Kate commitments from the Lagrange basis without FFTs: how to commit, evaluate and open polynomials in the Lagrange basis without FFTs. This is the first part in a series (see part 1, part 2, part 3) showing how to do PLONK-style universal SNARKs without FFTs
- Hadamard checks from the Lagrange basis without FFTs: how to prove Hadamard relations between polynomials in the Lagrange basis without FFTs. This is the second part (see part 1, part 2, part 3) in a series showing how to do PLONK-style universal SNARKs without FFTs.
- PLONK-style SNARKs without FFTs: how to do PLONK-style universal SNARKs without FFTs. This is part 3 in a series (part 1, part 2, part 3).
- An efficient verifiable state for zk-EVM and beyondfrom the Anemoi hash function
- Plonky2: Fast Recursive Arguments with PLONK and FRI
Codebases
Presentations