| # | Title | Citations |
| 1. | PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge Ariel Gabizon and Zachary J. Williamson and Oana Ciobotaru. 2019. | 683 |
| 2. | HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates Binyi Chen and Benedikt Bünz and Dan Boneh and Zhenfei Zhang. 2022. | 179 |
| 3. | plookup: A simplified polynomial protocol for lookup tables Ariel Gabizon and Zachary J. Williamson. 2020. | 121 |
| 4. | Caulk: Lookup Arguments in Sublinear Time Arantxa Zapico and Vitalik Buterin and Dmitry Khovratovich and Mary Maller and Anca Nitulescu and Mark Simkin. 2022. | 73 |
| 5. | cq: Cached quotients for fast lookups Liam Eagen and Dario Fiore and Ariel Gabizon. 2022. | 55 |
| 6. | Multivariate lookups based on logarithmic derivatives Ulrich Haböck. 2022. | 54 |
| 7. | Baloo: Nearly Optimal Lookup Arguments Zapico, Arantxa and Gabizon, Ariel and Khovratovich, Dmitry and Maller, Mary and R\`afols, Carla. 2022. | 41 |
| 8. | Caulk+: Table-independent lookup arguments Jim Posen and Assimakis A. Kattis. 2022. | 33 |
| 9. | Plonkup: Reconciling plonk with plookup Pearson, Luke and Fitzgerald, Joshua and Masip, H\'ector and Bell\'es-Mu\~noz, Marta and Mu\~noz-Tapia, Jose Luis. 2022. | 30 |
| 10. | flookup: Fractional decomposition-based lookups in quasi-linear time independent of table size Ariel Gabizon and Dmitry Khovratovich. 2022. | 26 |
| 11. | Improving logarithmic derivative lookups using GKR Shahar Papini and Ulrich Haböck. 2023. | 17 |
| 12. | SublonK: Sublinear Prover PlonK Arka Rai Choudhuri and Sanjam Garg and Aarushi Goel and Sruthi Sekar and Rohit Sinha. 2023. | 16 |
| 13. | Sublonk: Sublinear prover plonk Choudhuri, Arka Rai and Garg, Sanjam and Goel, Aarushi and Sekar, Sruthi and Sinha, Rohit. 2024. | 16 |
| 14. | {aPlonK} : Aggregated {PlonK} from Multi-Polynomial Commitment Schemes Miguel Ambrona and Marc Beunardeau and Anne-Laure Schmitt and Raphaël R. Toledo. 2022. | 16 |
| 15. | Efficient Functional Commitments: How to Commit to Private Functions Dan Boneh and Wilson Nguyen and Alex Ozdemir. 2021. | 14 |
| 16. | Proposal: The Turbo-PLONK program syntax for specifying SNARK programs Ariel Gabizon and Zachary J. Williamson. 2020. | 11 |
| 17. | fflonk: a Fast-Fourier inspired verifier efficient version of PlonK Ariel Gabizon and Zachary J. Williamson. 2021. | 7 |
| 18. | cqlin: Efficient linear operations on {KZG} commitments with cached quotients Liam Eagen and Ariel Gabizon. 2023. | 7 |
| 19. | Batching-Efficient {RAM} using Updatable Lookup Arguments Moumita Dutta and Chaya Ganesh and Sikhar Patranabis and Shubh Prakash and Nitin Singh. 2024. | 5 |
| 20. | UniPlonk: Plonk with Universal Verifier Shumo Chu and Brandon H. Gomes and Francisco Hernandez Iglesias and Todd Norton and Duncan Tebbs. 2023. | 4 |
| 21. | 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. | 4 |
| 22. | Simulation-Extractable {KZG} Polynomial Commitments and Applications to {HyperPlonk} Benoit Libert. 2024. | 3 |
| 23. | Accelerating the PlonK zkSNARK Proving System using GPU Architectures Derei, Tal. 2023. | 3 |
| 24. | RapidUp: Multi-domain permutation protocol for lookup tables Ardevol, H\'ector Masip and Mel\'e, Jordi Baylina and Lubarov, Daniel and Mu\~noz-Tapia, Jos\'e L. 2022. | 3 |
| 25. | How (not) to simulate PLONK Sefranek, Marek. 2024. | 2 |
| 26. | Plonkup scheme with multiple queries Alexandr Bulkin and Tim Dokchitser. 2023. | 1 |
| 27. | An optimization of the addition gate count in Plonkish circuits Thakur, Steve. 2023. | 0 |
| 28. | Public inputs in PlonK’s permutation argument Gabizon, Ariel and Williamson, Zachary J. 2021. | 0 |
