Papers (13)

#Title
Citations
1.PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge Ariel Gabizon and Zachary J. Williamson and Oana Ciobotaru. 2019.   
342
2.plookup: A simplified polynomial protocol for lookup tables Ariel Gabizon and Zachary J. Williamson. 2020.  
51
3.HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates Binyi Chen and Benedikt Bünz and Dan Boneh and Zhenfei Zhang. 2022.
44
4.cq: Cached quotients for fast lookups Liam Eagen and Dario Fiore and Ariel Gabizon. 2022.
18
5.Multivariate lookups based on logarithmic derivatives Ulrich Haböck. 2022.
11
6.flookup: Fractional decomposition-based lookups in quasi-linear time independent of table size Ariel Gabizon and Dmitry Khovratovich. 2022.
9
7.Efficient Functional Commitments: How to Commit to Private Functions Dan Boneh and Wilson Nguyen and Alex Ozdemir. 2021.
8
8.Proposal: The Turbo-PLONK program syntax for specifying SNARK programs Ariel Gabizon and Zachary J. Williamson. 2020.   
5
9.fflonk: a Fast-Fourier inspired verifier efficient version of PlonK Ariel Gabizon and Zachary J. Williamson. 2021.
3
10.Plonkup scheme with multiple queries Alexandr Bulkin and Tim Dokchitser. 2023.
1
11.UniPlonk: Plonk with Universal Verifier Shumo Chu and Brandon H. Gomes and Francisco Hernandez Iglesias and Todd Norton and Duncan Tebbs. 2023.
0
12.Scaling Zero-Knowledge to Verifiable Databases Derei, Tal and Aulenbach, Benjamin and Carolino, Victor and Geren, Caleb and Kaufman, Michael and Klein, Jonathan and Islam Shanto, Rishad and Korth, Henry F. 2023.
0
13.SublonK: Sublinear Prover PlonK Arka Rai Choudhuri and Sanjam Garg and Aarushi Goel and Sruthi Sekar and Rohit Sinha. 2023.
0

Videos

Implementations