plonky2 recursion circuit costs

3754 gates to root
| 367 gates to evaluate the vanishing polynomial at our challenge point, zeta.
| | 276 gates to evaluate gate constraints
| | | 2 gates to evaluate NoopGate constraints
| | | 0 gates to evaluate PublicInputGate constraints
| | | 15 gates to evaluate BaseSumGate { num_limbs: 63 } + Base: 2 constraints
| | | 27 gates to evaluate ReducingExtensionGate { num_coeffs: 32 } constraints
| | | 33 gates to evaluate ReducingGate { num_coeffs: 43 } constraints
| | | 11 gates to evaluate ArithmeticExtensionGate { num_ops: 10 } constraints
| | | 10 gates to evaluate ArithmeticGate { num_ops: 20 } constraints
| | | 10 gates to evaluate MulExtensionGate { num_ops: 13 } constraints
| | | 18 gates to evaluate RandomAccessGate { bits: 4, num_copies: 4, num_extra_constants: 2, _phantom: PhantomData<plonky2_field::goldilocks_field::GoldilocksField> }<D=2> constraints
| | | 23 gates to evaluate CosetInterpolationGate { subgroup_bits: 4, degree: 6, barycentric_weights: [17293822565076172801, 18374686475376656385, 18446744069413535745, 281474976645120, 17592186044416, 18446744069414584577, 18446744000695107601, 18446744065119617025, 1152921504338411520, 72057594037927936, 18446744069415632897, 18446462594437939201, 18446726477228539905, 18446744069414584065, 68719476720, 4294967296], _phantom: PhantomData<plonky2_field::goldilocks_field::GoldilocksField> }<D=2> constraints
| | | 127 gates to evaluate PoseidonGate(PhantomData<plonky2_field::goldilocks_field::GoldilocksField>)<WIDTH=12> constraints
| 1 gates to check vanishing and quotient polynomials.
| 3271 gates to verify FRI proof
| | 1 gates to check PoW
| | 8 gates to precompute reduced evaluations
| | 114 gates to verify one (of 28) query rounds
| | | 81 gates to check FRI initial proof
| | | | 23 gates to verify 0'th initial Merkle proof
| | | | 29 gates to verify 1'th initial Merkle proof
| | | | 15 gates to verify 2'th initial Merkle proof
| | | | 14 gates to verify 3'th initial Merkle proof
| | | 0 gates to compute x from its index
| | | 6 gates to combine initial oracles
| | | 1 gates to infer evaluation using interpolation
| | | 12 gates to verify FRI round Merkle proof.
| | | 1 gates to infer evaluation using interpolation
| | | 8 gates to verify FRI round Merkle proof.
| | | 1 gates to evaluate final polynomial of length 16