ark-ldt
is a Rust library that provides implementations of low-degree tests (LDTs). This library is released under the MIT License
and the Apache v2 License (see License).
WARNING: This is an academic prototype, and in particular has not received careful code review. This implementation is NOT ready for production use.
A (univariate) low-degree test is an IOP that checks that a given function is close to a (univariate) polynomial of low degree. This library provides two LDTs: the direct low-degree test and the FRI Protocol. The library also comes with R1CS constraints for the LDT verifiers. Enable r1cs
feature to use those constraints.
The library compiles on the stable
toolchain of the Rust compiler. To install the latest version
of Rust, first install rustup
by following the instructions here, or via
your platform's package manager. Once rustup
is installed, install the Rust toolchain by invoking:
rustup install stable
After that, use cargo
(the standard Rust build tool) to build the library:
git clone https://github.com/arkworks-rs/ldt.git
cd ldt
cargo build --release
This library comes with some unit and integration tests. Run these tests with:
cargo test
To use this library, you need to add the following to your Cargo.toml
. Note that this configuration will bump ark-sponge
and ark-r1cs-std
to master
/main
instead of stable version on crates.io
.
[dependencies]
ark-ldt = {git = "https://github.com/arkworks-rs/ldt", branch="main", default-features = false}
[patch.crates-io]
ark-sponge = {git = "https://github.com/arkworks-rs/sponge"}
ark-r1cs-std = {git = "https://github.com/arkworks-rs/r1cs-std", branch = "master"}
This library is licensed under either of the following licenses, at your discretion.
Unless you explicitly state otherwise, any contribution that you submit to this library shall be dual licensed as above (as defined in the Apache v2 License), without any additional terms or conditions.
Fractal: Post-Quantum and Transparent Recursive Proofs from Holography
Alessandro Chiesa, Dev Ojha, Nicholas Spooner
Fast Reed-Solomon Interactive Oracle Proofs of Proximity
Eli Ben-Sasson, Iddo Bentov, Ynon Horesh, Michael Riabzev