plonk
plonk copied to clipboard
Pure Rust implementation of the PLONK ZKProof System done by the Dusk-Network team.
There are still unchecked conversions in the code. Specifically [here](https://github.com/dusk-network/plonk/blob/add_lookups/src/constraint_system/ecc/curve_addition/variable_base_gate.rs#L29-L37). We should what pros and cons of keeping/removing them. If we decide to keep them we should comment them properly....
**Describe what you want implemented** Every constraint appended to a composer must also push its `Constraint` instance to an internal vector of constraints. This will deprecate the multiple selectors that...
**Describe what you want implemented** Remove the `bit_iterator` macro. **Describe "Why" this is needed** As far as I can see we only invoke the macro once to create `BitIterator8` so...
**Describe what kind of specification you want to have created** Under the documentation module, add articles that help understand PlonK, e.g.: - Zero Knowledge Proofs - Finite fields of elliptic...
Create a presentation on Kate polynomial commitments adapted to the PlonK framework.
### What's wrong The variable k in the check_circuit_satisfied should check if constraints related to q_fixed_group_add and q_variable_group_add selectors are satisfied, but the check is unimplemented now. ### How can...
from what I see code , both in pre process and prove stage, lots of polynomials need to be committed,, such as : " let q_m_poly_commit = commit_key.commit(&q_m_poly).unwrap_or_default(); let q_l_poly_commit...
This relies on the test that shows that they do indeed form cosets
To simplify the API for public/private variables; Add a gate for each public variable constraining it to a witness, then use the witness in the gates instead of a public...
We have an excessive usage of `for _ in ..` which doesn't take profit of the `Iterator` benefits such as the autovectorization. Specially, there were included several `for` loops in...