From 1d576f2046398d07eb1867ae41b7be8e87181649 Mon Sep 17 00:00:00 2001 From: Daniel Lubarov Date: Mon, 3 Jan 2022 10:00:15 -0800 Subject: [PATCH] licensing note --- README.md | 11 ++++++++--- 1 file changed, 8 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 7191486e..f677a7c6 100644 --- a/README.md +++ b/README.md @@ -1,8 +1,8 @@ -# plonky2 +# 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](https://arxiv.org/abs/1903.12243) paper. It is the successor of [plonky](https://github.com/mir-protocol/plonky), which was based on Plonk and Halo. +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](https://arxiv.org/abs/1903.12243) paper. It is the successor of [plonky](https://github.com/mir-protocol/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. +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 @@ -14,6 +14,11 @@ RUST_LOG=debug RUSTFLAGS=-Ctarget-cpu=native cargo test --release test_recursive ``` +## Copyright + +Plonky2 was developed by Polygon Zero (formerly Mir). While we plan to adopt an open source license, we haven't selected one yet, so all rights are reserved for the time being. Please reach out to us if you have thoughts on licensing. + + ## Disclaimer This code has not been thoroughly reviewed or tested, and should not be used in any production systems.