slop-fri 6.2.4

Re-exports p3_fri from Plonky3 for SLOP

Coverage
0%
0 out of 1 items documented0 out of 0 items with examples
Size
Source code size: 11.61 kB This is the summed size of all the files inside the crates.io package for this release.
Documentation size: 967.35 kB This is the summed size of all files generated by rustdoc for all configured targets
Ø build duration
this release: 12s Average build duration of successful builds.
all releases: 36s Average build duration of successful builds in releases after 2024-10-23.
Links
succinctlabs/sp1
1694 664 21
crates.io
Dependencies
- p3-fri =0.4.3-succinct normal
Versions
Owners

slop-fri

Re-exports p3_fri from Plonky3 for use in the SLOP library.

This crate provides FRI (Fast Reed-Solomon Interactive Oracle Proof of Proximity) protocol implementations. FRI is used to prove that a committed polynomial has low degree, forming a core component of STARK proof systems. For the BaseFold implementation in slop-basefold-prover, all that is needed from this module is fold_even_odd, the function which performs the FRI folding step on Reed-Solomon codewords.

License

This crate re-exports code from Plonky3, which is licensed under MIT/Apache-2.0.

Part of SLOP, the Succinct Library of Polynomials.