# Uncategorized **URL:** https://www.plonk.cafe/c/uncategorized/1.md [Latest](https://www.plonk.cafe/latest.md) · [Categories](https://www.plonk.cafe/categories.md) · [Tags](https://www.plonk.cafe/tags.md) --- ## [Café etiquette & rules](https://www.plonk.cafe/t/cafe-etiquette-rules/26)
**Author:** [@tom](https://www.plonk.cafe/u/tom)\ **Replies:** 0\ **Last updated:** [15 May 2020 14:56 UTC](https://www.plonk.cafe/t/cafe-etiquette-rules/26 "2020-05-15T14:56:01Z")
Welcome to the PLONK Café! We opened this premises in May 2020 to bring discussion from the PLONK Working Group on Telegram into the public forum. Discussions in our café must be kept highly technical - either proposing … --- ## [Is there open-source Plonkup implementation?](https://www.plonk.cafe/t/is-there-open-source-plonkup-implementation/232)
**Author:** [@lfzkoala](https://www.plonk.cafe/u/lfzkoala)\ **Replies:** 0\ **Last updated:** [24 April 2023 21:36 UTC](https://www.plonk.cafe/t/is-there-open-source-plonkup-implementation/232 "2023-04-24T21:36:31Z")
The question is as the title, trying to implement Plonkup using Rust but didn’t find any open-source implementation of it --- ## [How to choose the value of state width of Plonk with lookup?](https://www.plonk.cafe/t/how-to-choose-the-value-of-state-width-of-plonk-with-lookup/230)
**Author:** [@lfzkoala](https://www.plonk.cafe/u/lfzkoala)\ **Replies:** 0\ **Last updated:** [13 April 2023 06:58 UTC](https://www.plonk.cafe/t/how-to-choose-the-value-of-state-width-of-plonk-with-lookup/230 "2023-04-13T06:58:17Z")
I noticed that it seems the original Plonk paper introduced that there were two extensions with state width = 3 or 4 (as described in proof\_system\_info\_v1.0/README.md at master · matter-labs/proof\_system\_info\_v1.0 · GitH… --- ## [Naming if you're working on a plonkish protocol](https://www.plonk.cafe/t/naming-if-youre-working-on-a-plonkish-protocol/208)
**Author:** [@david](https://www.plonk.cafe/u/david)\ **Replies:** 0\ **Last updated:** [4 December 2022 04:39 UTC](https://www.plonk.cafe/t/naming-if-youre-working-on-a-plonkish-protocol/208 "2022-12-04T04:39:50Z")
I’ve asked ChatGPT to come up with names for any future plonk-based scheme: Input: in this series of zero-knowledge proof systems, can you give a few suggestions to name the next one? plonk turboplonk ultraplonk hyper… --- ## [Verify kzg commitment](https://www.plonk.cafe/t/verify-kzg-commitment/191)
**Author:** [@nier](https://www.plonk.cafe/u/nier)\ **Replies:** 3\ **Last updated:** [8 November 2022 17:11 UTC](https://www.plonk.cafe/t/verify-kzg-commitment/191 "2022-11-08T17:11:30Z")
In the main protocol, the verifier checks all the commitments (\[a\],\[b\],\[c\],…) are in the G\_1. This will ensure the commitment is from some polynomials but not ensure it has degree less than maximum degree from SRS. Does… --- ## [How PLONK works in two parts](https://www.plonk.cafe/t/how-plonk-works-in-two-parts/206)
**Author:** [@sCrypt](https://www.plonk.cafe/u/sCrypt)\ **Replies:** 0\ **Last updated:** [12 October 2022 22:22 UTC](https://www.plonk.cafe/t/how-plonk-works-in-two-parts/206 "2022-10-12T22:22:29Z")
I had difficulty understanding existing PLONK explanations, so I wrote my own version in 2 parts. Hope this helps others. Please lmk if u have any comments How PLONK Works: Part 1. PLONK is a state-of-the-art zk-SNARK… |… --- ## [Why does the prover send the permutation polynomials?](https://www.plonk.cafe/t/why-does-the-prover-send-the-permutation-polynomials/132)
**Author:** [@david](https://www.plonk.cafe/u/david)\ **Replies:** 1\ **Last updated:** [24 June 2021 10:01 UTC](https://www.plonk.cafe/t/why-does-the-prover-send-the-permutation-polynomials/132 "2021-06-24T10:01:13Z")
Hello hello, I have a question on one of the steps of the proof. In round 4 the prover evaluates the permutation polynomials at some point \\zeta and then sends these evaluations. Later the verifier checks these evaluati… --- ## [Details of custom gate](https://www.plonk.cafe/t/details-of-custom-gate/122)
**Author:** [@spartucus](https://www.plonk.cafe/u/spartucus)\ **Replies:** 9\ **Last updated:** [2 June 2021 02:17 UTC](https://www.plonk.cafe/t/details-of-custom-gate/122 "2021-06-02T02:17:55Z")
Hi all, I heard a lot of custom gates in plonk, but can’t find anything about what it is, how it does, and any related projects that use it. I would be every thankful if someone could point that out. --- ## [Non-native field arithmetic with TurboPlonk, Plookup, etc](https://www.plonk.cafe/t/non-native-field-arithmetic-with-turboplonk-plookup-etc/90)
**Author:** [@brendan](https://www.plonk.cafe/u/brendan)\ **Replies:** 4\ **Last updated:** [13 August 2020 09:09 UTC](https://www.plonk.cafe/t/non-native-field-arithmetic-with-turboplonk-plookup-etc/90 "2020-08-13T09:09:16Z")
We’re experimenting with different approaches to non-native field arithmetic using custom gates and plookup, and it would be great to hear from other teams, particularly Aztec, about their approaches, and the resulting c… --- ## [Supporting High-Arity and High-Depth Gates with Constant Cost](https://www.plonk.cafe/t/supporting-high-arity-and-high-depth-gates-with-constant-cost/65)
**Author:** [@jon-chuang](https://www.plonk.cafe/u/jon-chuang)\ **Replies:** 2\ **Last updated:** [18 June 2020 07:19 UTC](https://www.plonk.cafe/t/supporting-high-arity-and-high-depth-gates-with-constant-cost/65 "2020-06-18T07:19:13Z")
This is a proposal to support gates of high multiplicative depth \\mathcal{O}(\\sqrt{n}) with additional-wire number of \\mathbb{G}\_1 elements increase in proof size over an equivalent Plonk circuit of size n. Proving cost … --- ## [Desired Features for a PLONK Optimising Compiler](https://www.plonk.cafe/t/desired-features-for-a-plonk-optimising-compiler/69)
**Author:** [@jon-chuang](https://www.plonk.cafe/u/jon-chuang)\ **Replies:** 0\ **Last updated:** [17 June 2020 17:19 UTC](https://www.plonk.cafe/t/desired-features-for-a-plonk-optimising-compiler/69 "2020-06-17T17:19:04Z")
Compiler front end: Standard things: Constant subexpression elimination etc. Backend (gates and constraints): Automatic custom gate synthesis for repeated basic blocks Cost model for balancing proof size, prover exp… --- ## [Understanding PLONK](https://www.plonk.cafe/t/understanding-plonk/67)
**Author:** [@jon-chuang](https://www.plonk.cafe/u/jon-chuang)\ **Replies:** 1\ **Last updated:** [17 June 2020 15:04 UTC](https://www.plonk.cafe/t/understanding-plonk/67 "2020-06-17T15:04:40Z")
This thread is about basic questions about PLONK that are not explained in the papers. I will start off: Why do we require the degrees for the polynomials to be \