plonky
plonky copied to clipboard
0xPolygonZero
Recursive SNARKs based on Plonk and Halo
PR #100 introduced some duplication in the tests for curves and fields. These should be refactored.
This branch contains an implementation of [Daira Hopwood's reduction algorithm](https://hackmd.io/drzN-z-_So28zDLhK2tegw) for the Tweedle{dee,dum} curves. More precisely, the reduction algorithm is implemented but only enabled for _Tweedledee_, while Tweedledum remains with...
There are a few existing open Montgomeral modmul implementations which might (i) form a good/better basis for our improvements in Plonky, or (ii) in any case, they should at least...
In order to measure performance improvements, and protect against performance regressions (while refactoring, for example, see #68), we should measure the performance of the current field arithmetic implementations in a...
It can be advantageous to leave a few bits of space in the representation of an element of a base field and to allow a certain number of overflows into...
Carry chains in field arithmetic are a significant source of data dependency which can cause pipeline stalls and bubbles. In some cases instead of handling carries at their source we...
There are several ways to vectorise modular multiplication (see [Section 4 of this article](https://eprint.iacr.org/2017/1057.pdf) for example). In some cases we may be able to write high-level code from which the...