starkom-poly 2.0.0

Algorithms over polynomials used in Starkom (NTT, Lagrange interpolation, etc.).

Coverage
100%
2 out of 2 items documented0 out of 0 items with examples
Size
Source code size: 154.84 kB This is the summed size of all the files inside the crates.io package for this release.
Documentation size: 898.22 kB This is the summed size of all files generated by rustdoc for all configured targets
Ø build duration
this release: 11s Average build duration of successful builds.
all releases: 9s Average build duration of successful builds in releases after 2024-10-23.
Links
libernet-xyz/poly
0 0 0
crates.io
Dependencies
Versions
Owners

Polynomials

Overview

This crate contains several algorithms over polynomials used in Starkom (NTT, Lagrange interpolation, etc.).

Most algorithms are implemented generically for any prime field. The main requirement is that the field implements the PrimeField trait provided in the starkom-ff crate.