Module risc0_zkp::prove::poly_group
source · Structs
A PolyGroup represents a group of polynomials, all of the same maximum
degree, as well as the evaluation of those polynomials over some domain that
is larger than that degree by some invRate. Additionally, it includes a
dense Merkle tree, where each entry is a single point of the domain, and the
leaf hash is a simple linear hash of all of the values at that point. That
is, if we have 100 polynomials evaluated on 2^16 points, the merkle tree has
2^16 entries, each being a hash of 100 values. The size of the domain is
always a power of 2 so that we can use NTTs.