21bdc6b380
We'll add back a license later, potentially the same one, but just want to take our time thinking about which one to select.
946 B
plonky2
plonky2 is an implementation of recursive arguments based on Plonk and FRI. It uses FRI to check systems of polynomial constraints, similar to the DEEP-ALI method described in the DEEP-FRI paper. It is the successor of plonky, which was based on Plonk and Halo.
plonky2 is largely focused on recursion performance. We use custom gates to mitigate the bottlenecks of FRI verification, such as hashing and interpolation. We also encode witness data in a ~64 bit field, so field operations take just a few cycles. To achieve 128-bit security, we repeat certain checks, and run certain parts of the argument in an extension field.
Running
To run the recursion benchmark,
RUSTFLAGS=-Ctarget-cpu=native cargo run --release
Disclaimer
This code has not been thoroughly reviewed or tested, and should not be used in any production systems.