Barretenberg
The ZK-SNARK library at the core of Aztec
Loading...
Searching...
No Matches
translator_non_native_field_relation_impl.hpp
Go to the documentation of this file.
1// === AUDIT STATUS ===
2// internal: { status: Planned, auditors: [], commit: }
3// external_1: { status: not started, auditors: [], commit: }
4// external_2: { status: not started, auditors: [], commit: }
5// =====================
6
7#pragma once
10
11namespace bb {
77template <typename FF>
78template <typename ContainerOverSubrelations, typename AllEntities, typename Parameters>
79void TranslatorNonNativeFieldRelationImpl<FF>::accumulate(ContainerOverSubrelations& accumulators,
80 const AllEntities& in,
81 const Parameters& params,
82 const FF& scaling_factor)
83{
84
86 using View = typename Accumulator::View;
87
88 static constexpr size_t NUM_LIMB_BITS = 68;
89 static const FF shift = FF(uint256_t(1) << NUM_LIMB_BITS);
90 static const FF shiftx2 = FF(uint256_t(1) << (NUM_LIMB_BITS * 2));
91 static const FF shiftx3 = FF(uint256_t(1) << (NUM_LIMB_BITS * 3));
92 static const std::array<FF, 5> NEGATIVE_MODULUS_LIMBS =
93 TranslatorCircuitBuilder::compute_negative_modulus_limbs<FF>();
94
95 // Limbs of evaluation challenge x
96 const auto& evaluation_input_x_0 = params.evaluation_input_x[0];
97 const auto& evaluation_input_x_1 = params.evaluation_input_x[1];
98 const auto& evaluation_input_x_2 = params.evaluation_input_x[2];
99 const auto& evaluation_input_x_3 = params.evaluation_input_x[3];
100 const auto& evaluation_input_x_4 = params.evaluation_input_x[4];
101
102 // Limbs of batching challenge v
103 const auto& v_0 = params.batching_challenge_v[0][0];
104 const auto& v_1 = params.batching_challenge_v[0][1];
105 const auto& v_2 = params.batching_challenge_v[0][2];
106 const auto& v_3 = params.batching_challenge_v[0][3];
107 const auto& v_4 = params.batching_challenge_v[0][4];
108
109 // Limbs of batching challenge v²
110 const auto& v_sqr_0 = params.batching_challenge_v[1][0];
111 const auto& v_sqr_1 = params.batching_challenge_v[1][1];
112 const auto& v_sqr_2 = params.batching_challenge_v[1][2];
113 const auto& v_sqr_3 = params.batching_challenge_v[1][3];
114 const auto& v_sqr_4 = params.batching_challenge_v[1][4];
115
116 // Limbs of batching challenge v³
117 const auto& v_cube_0 = params.batching_challenge_v[2][0];
118 const auto& v_cube_1 = params.batching_challenge_v[2][1];
119 const auto& v_cube_2 = params.batching_challenge_v[2][2];
120 const auto& v_cube_3 = params.batching_challenge_v[2][3];
121 const auto& v_cube_4 = params.batching_challenge_v[2][4];
122
123 // Limbs of batching challenge v⁴
124 const auto& v_quad_0 = params.batching_challenge_v[3][0];
125 const auto& v_quad_1 = params.batching_challenge_v[3][1];
126 const auto& v_quad_2 = params.batching_challenge_v[3][2];
127 const auto& v_quad_3 = params.batching_challenge_v[3][3];
128 const auto& v_quad_4 = params.batching_challenge_v[3][4];
129
130 // Fetch witness values
131 // Pₓ = (Pₓ,₃ || Pₓ,₂ || Pₓ,₁ || Pₓ,₀)
132 // Pᵧ = (Pᵧ,₃ || Pᵧ,₂ || Pᵧ,₁ || Pᵧ,₀)
133 // z₁ = (z₁,₁ || z₁,₀)
134 // z₂ = (z₂,₁ || z₂,₀)
135 // Q = (q₃ || q₂ || q₁ || q₀)
136 const auto& op = View(in.op);
137 const auto& p_x_limb_0 = View(in.p_x_low_limbs);
138 const auto& p_y_limb_0 = View(in.p_y_low_limbs);
139 const auto& p_x_limb_2 = View(in.p_x_high_limbs);
140 const auto& p_y_limb_2 = View(in.p_y_high_limbs);
141 const auto& accumulators_binary_limbs_0 = View(in.accumulators_binary_limbs_0);
142 const auto& accumulators_binary_limbs_1 = View(in.accumulators_binary_limbs_1);
143 const auto& accumulators_binary_limbs_2 = View(in.accumulators_binary_limbs_2);
144 const auto& accumulators_binary_limbs_3 = View(in.accumulators_binary_limbs_3);
145 const auto& z_first_limb_0 = View(in.z_low_limbs);
146 const auto& z_first_limb_1 = View(in.z_high_limbs);
147 const auto& quotient_binary_limbs_0 = View(in.quotient_low_binary_limbs);
148 const auto& quotient_binary_limbs_1 = View(in.quotient_low_binary_limbs_shift);
149 const auto& p_x_limb_1 = View(in.p_x_low_limbs_shift);
150 const auto& p_y_limb_1 = View(in.p_y_low_limbs_shift);
151 const auto& p_x_limb_3 = View(in.p_x_high_limbs_shift);
152 const auto& p_y_limb_3 = View(in.p_y_high_limbs_shift);
153 const auto& prev_accumulators_binary_limbs_0 = View(in.accumulators_binary_limbs_0_shift);
154 const auto& prev_accumulators_binary_limbs_1 = View(in.accumulators_binary_limbs_1_shift);
155 const auto& prev_accumulators_binary_limbs_2 = View(in.accumulators_binary_limbs_2_shift);
156 const auto& prev_accumulators_binary_limbs_3 = View(in.accumulators_binary_limbs_3_shift);
157 const auto& z_second_limb_0 = View(in.z_low_limbs_shift);
158 const auto& z_second_limb_1 = View(in.z_high_limbs_shift);
159 const auto& quotient_binary_limbs_2 = View(in.quotient_high_binary_limbs);
160 const auto& quotient_binary_limbs_3 = View(in.quotient_high_binary_limbs_shift);
161 const auto& relation_wide_limbs_lo = View(in.relation_wide_limbs);
162 const auto& relation_wide_limbs_hi = View(in.relation_wide_limbs_shift);
163 const auto& lagrange_even_in_minicircuit = View(in.lagrange_even_in_minicircuit);
164
173 // clang-format off
174 // T₀: Limb 0 contribution (all products contributing at weight 2⁰)
175 auto tmp = prev_accumulators_binary_limbs_0 * evaluation_input_x_0
176 + op
177 + p_x_limb_0 * v_0
178 + p_y_limb_0 * v_sqr_0
179 + z_first_limb_0 * v_cube_0
180 + z_second_limb_0 * v_quad_0
181 + quotient_binary_limbs_0 * NEGATIVE_MODULUS_LIMBS[0]
182 - accumulators_binary_limbs_0;
183
184 // T₁: Limb 1 contribution (all cross-products contributing at weight 2⁶⁸)
185 tmp += (prev_accumulators_binary_limbs_1 * evaluation_input_x_0
186 + prev_accumulators_binary_limbs_0 * evaluation_input_x_1
187 + p_x_limb_0 * v_1
188 + p_x_limb_1 * v_0
189 + p_y_limb_0 * v_sqr_1
190 + p_y_limb_1 * v_sqr_0
191 + z_first_limb_0 * v_cube_1
192 + z_first_limb_1 * v_cube_0
193 + z_second_limb_0 * v_quad_1
194 + z_second_limb_1 * v_quad_0
195 + quotient_binary_limbs_0 * NEGATIVE_MODULUS_LIMBS[1]
196 + quotient_binary_limbs_1 * NEGATIVE_MODULUS_LIMBS[0]
197 - accumulators_binary_limbs_1)
198 * shift ;
199 // clang-format on
200 // Subtract 2¹³⁶·c_lo: if the result is zero, lower 136 bits are correct
201 tmp -= relation_wide_limbs_lo * shiftx2;
202 tmp *= lagrange_even_in_minicircuit * op;
203 tmp *= scaling_factor;
204 std::get<0>(accumulators) += tmp;
205
215 // clang-format off
216 // T₂: Limb 2 contribution (with carry from lower 136 bits)
217 tmp = relation_wide_limbs_lo
218 + prev_accumulators_binary_limbs_2 * evaluation_input_x_0
219 + prev_accumulators_binary_limbs_1 * evaluation_input_x_1
220 + prev_accumulators_binary_limbs_0 * evaluation_input_x_2
221 + p_x_limb_2 * v_0
222 + p_x_limb_1 * v_1
223 + p_x_limb_0 * v_2
224 + p_y_limb_2 * v_sqr_0
225 + p_y_limb_1 * v_sqr_1
226 + p_y_limb_0 * v_sqr_2
227 + z_first_limb_1 * v_cube_1
228 + z_first_limb_0 * v_cube_2
229 + z_second_limb_1 * v_quad_1
230 + z_second_limb_0 * v_quad_2
231 + quotient_binary_limbs_2 * NEGATIVE_MODULUS_LIMBS[0]
232 + quotient_binary_limbs_1 * NEGATIVE_MODULUS_LIMBS[1]
233 + quotient_binary_limbs_0 * NEGATIVE_MODULUS_LIMBS[2]
234 - accumulators_binary_limbs_2;
235
236 // T₃: Limb 3 contribution (all cross-products contributing at weight 2²⁰⁴)
237 tmp += (prev_accumulators_binary_limbs_3 * evaluation_input_x_0
238 + prev_accumulators_binary_limbs_2 * evaluation_input_x_1
239 + prev_accumulators_binary_limbs_1 * evaluation_input_x_2
240 + prev_accumulators_binary_limbs_0 * evaluation_input_x_3
241 + p_x_limb_3 * v_0
242 + p_x_limb_2 * v_1
243 + p_x_limb_1 * v_2
244 + p_x_limb_0 * v_3
245 + p_y_limb_3 * v_sqr_0
246 + p_y_limb_2 * v_sqr_1
247 + p_y_limb_1 * v_sqr_2
248 + p_y_limb_0 * v_sqr_3
249 + z_first_limb_1 * v_cube_2
250 + z_first_limb_0 * v_cube_3
251 + z_second_limb_1 * v_quad_2
252 + z_second_limb_0 * v_quad_3
253 + quotient_binary_limbs_3 * NEGATIVE_MODULUS_LIMBS[0]
254 + quotient_binary_limbs_2 * NEGATIVE_MODULUS_LIMBS[1]
255 + quotient_binary_limbs_1 * NEGATIVE_MODULUS_LIMBS[2]
256 + quotient_binary_limbs_0 * NEGATIVE_MODULUS_LIMBS[3]
257 - accumulators_binary_limbs_3)
258 * shift;
259 // clang-format on
260 // Subtract 2¹³⁶·c_hi: if the result is zero, higher 136 bits are correct
261 tmp -= relation_wide_limbs_hi * shiftx2;
262 tmp *= lagrange_even_in_minicircuit * op;
263 tmp *= scaling_factor;
264 std::get<1>(accumulators) += tmp;
265
266 // Helper functions to reconstruct field elements from limbs
267 const auto reconstruct_from_two = [](const auto& l0, const auto& l1) { return l0 + l1 * shift; };
268
269 const auto reconstruct_from_four = [](const auto& l0, const auto& l1, const auto& l2, const auto& l3) {
270 return l0 + l1 * shift + l2 * shiftx2 + l3 * shiftx3;
271 };
272
273 // Reconstruct native 𝔽ᵣ representations from binary limbs
274 auto reconstructed_p_x = reconstruct_from_four(p_x_limb_0, p_x_limb_1, p_x_limb_2, p_x_limb_3);
275 auto reconstructed_p_y = reconstruct_from_four(p_y_limb_0, p_y_limb_1, p_y_limb_2, p_y_limb_3);
276 auto reconstructed_previous_accumulator = reconstruct_from_four(prev_accumulators_binary_limbs_0,
277 prev_accumulators_binary_limbs_1,
278 prev_accumulators_binary_limbs_2,
279 prev_accumulators_binary_limbs_3);
280 auto reconstructed_current_accumulator = reconstruct_from_four(accumulators_binary_limbs_0,
281 accumulators_binary_limbs_1,
282 accumulators_binary_limbs_2,
283 accumulators_binary_limbs_3);
284 auto reconstructed_z1 = reconstruct_from_two(z_first_limb_0, z_first_limb_1);
285 auto reconstructed_z2 = reconstruct_from_two(z_second_limb_0, z_second_limb_1);
286 auto reconstructed_quotient = reconstruct_from_four(
287 quotient_binary_limbs_0, quotient_binary_limbs_1, quotient_binary_limbs_2, quotient_binary_limbs_3);
288
297 // clang-format off
298 // Compute accumulation formula using native 𝔽ᵣ arithmetic (limb index 4)
299 tmp = reconstructed_previous_accumulator * evaluation_input_x_4
300 + op
301 + reconstructed_p_x * v_4
302 + reconstructed_p_y * v_sqr_4
303 + reconstructed_z1 * v_cube_4
304 + reconstructed_z2 * v_quad_4
305 + reconstructed_quotient * NEGATIVE_MODULUS_LIMBS[4]
306 - reconstructed_current_accumulator;
307 // clang-format on
308 tmp *= lagrange_even_in_minicircuit * op;
309 tmp *= scaling_factor;
310 std::get<2>(accumulators) += tmp;
311};
312} // namespace bb
bb::field< bb::Bn254FrParams > FF
Definition field.cpp:24
static void accumulate(ContainerOverSubrelations &accumulators, const AllEntities &in, const Parameters &params, const FF &scaling_factor)
Expression for the computation of Translator accumulator in integers through 68-bit limbs and native ...
Entry point for Barretenberg command-line interface.
Definition api.hpp:5
constexpr decltype(auto) get(::tuplet::tuple< T... > &&t) noexcept
Definition tuple.hpp:13