|
| static constexpr std::array< Fr, big_domain_size > | construct_big_domain () |
| |
|
static constexpr std::array< Fr, domain_size > | construct_lagrange_denominators (const auto &big_domain) |
| |
|
static constexpr std::array< Fr, domain_size *num_evals > | batch_invert (const std::array< Fr, domain_size *num_evals > &coeffs) |
| |
|
static constexpr std::array< Fr, domain_size *num_evals > | construct_denominator_inverses (const auto &big_domain, const auto &lagrange_denominators) |
| |
|
static constexpr std::array< Fr, num_evals > | construct_full_numerator_values (const auto &big_domain) |
| |
template<class
Fr, size_t domain_end, size_t num_evals, size_t domain_start = 0>
class barretenberg::BarycentricDataCompileTime< Fr, domain_end, num_evals, domain_start >
- Todo:
- : TODO(https://github.com/AztecProtocol/barretenberg/issues/713) Optimize with lookup tables?
- Template Parameters
-
| domain_end,domain_start | specify the given evaluation domain {domain_start,..., domain_end - 1} |
| num_evals | the number of evaluations that are computable with specific barycentric extension formula |