|
| template<typename ContainerOverSubrelations , typename AllEntities , typename Parameters > |
| static void | accumulate (ContainerOverSubrelations &accumulators, const AllEntities &in, const Parameters &, const FF &scaling_factor) |
| | Expression for the generalized permutation sort gate.
|
| |
◆ accumulate()
template<typename FF_ >
template<typename ContainerOverSubrelations , typename AllEntities , typename Parameters >
| static void proof_system::GenPermSortRelationImpl< FF_ >::accumulate |
( |
ContainerOverSubrelations & |
accumulators, |
|
|
const AllEntities & |
in, |
|
|
const Parameters & |
, |
|
|
const FF & |
scaling_factor |
|
) |
| |
|
inlinestatic |
Expression for the generalized permutation sort gate.
The relation is defined as C(in(X)...) = q_sort * \sum{ i = [0, 3]} \alpha^i D_i(D_i - 1)(D_i - 2)(D_i - 3) where D_0 = w_2 - w_1 D_1 = w_3 - w_2 D_2 = w_4 - w_3 D_3 = w_1_shift - w_4
- Parameters
-
| evals | transformed to evals + C(in(X)...)*scaling_factor |
| in | an std::array containing the fully extended Univariate edges. |
| parameters | contains beta, gamma, and public_input_delta, .... |
| scaling_factor | optional term to scale the evaluation before adding to evals. |
◆ SUBRELATION_PARTIAL_LENGTHS
The documentation for this class was generated from the following file: