midnight-circuits 7.0.0

Circuit and gadget implementations for Midnight zero-knowledge proofs
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
// This file is part of MIDNIGHT-ZK.
// Copyright (C) 2025 Midnight Foundation
// SPDX-License-Identifier: Apache-2.0
// Licensed under the Apache License, Version 2.0 (the "License");
// You may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

use std::{marker::PhantomData, ops::Rem};

use midnight_proofs::{
    circuit::{Chip, Layouter, Value},
    plonk::{Column, ConstraintSystem, Constraints, Error, Expression, Fixed, Selector},
    poly::Rotation,
};
use num_bigint::{BigInt as BI, ToBigInt};
use num_traits::One;

use crate::{
    ecc::curves::CircuitCurve,
    field::foreign::{
        params::FieldEmulationParams,
        util::{
            compute_u, compute_vj, get_advice_vec, get_identity_auxiliary_bounds, pair_wise_prod,
            sum_bigints, sum_exprs, urem,
        },
        FieldChip, FieldChipConfig,
    },
    instructions::NativeInstructions,
    types::AssignedField,
    utils::util::bigint_to_fe,
    CircuitField,
};

/// Foreign-field custom gate for point addition on twisted Edwards curves.
///
/// The gate enforces the identity `x * (1 ± w) = y + z mod m`, where the
/// sign is controlled by a fixed column (`+1` or `-1`) called `sign_col`.
#[derive(Clone, Debug, Eq, PartialEq)]
pub struct AdditionConfig<C: CircuitCurve> {
    q: Selector,
    u_bounds: (BI, BI),
    vs_bounds: Vec<(BI, BI)>,
    sign_col: Column<Fixed>,
    _marker: PhantomData<C>,
}

impl<C: CircuitCurve> AdditionConfig<C> {
    /// Checks that the FieldEmulationParams are sound for implementing the
    /// addition assertion. Returns (k_min, u_max), {(lj_min, vj_max)}_j, which
    /// are parameters involved in the identities enforced by the ModArith
    /// custom gate. We refer to the implementation of this function for
    /// explanations on what such values represent.
    pub fn bounds<F, P>(
        nb_parallel_range_checks: usize,
        max_bit_len: u32,
    ) -> ((BI, BI), Vec<(BI, BI)>)
    where
        F: CircuitField,
        P: FieldEmulationParams<F, C::Base>,
    {
        let base = BI::from(2).pow(P::LOG2_BASE);
        let nb_limbs = P::NB_LIMBS;
        let moduli = P::moduli();
        let bs = P::base_powers();
        let bs_sqrd = P::double_base_powers();

        // The equation of this custom gate is (with sign s = ±1):
        // x * (1 + s * w) = y + z    (mod m)
        //
        // It models the coordinates of the complete addition formula
        // on twisted Edwards curves:
        // (Rx,Ry) = (Px,Py) + (Qx,Qy)
        // <=>
        // Rx * (1 + d * Px * Py * Qx * Qy) = Px * Qy +     Py * Qx
        // Ry * (1 - d * Px * Py * Qx * Qy) = Py * Qy - a * Px * Qx
        //
        //
        // Let x := 1 + sum_i B^i * x_i
        //     y := 1 + sum_i B^i * y_i
        //     z := 1 + sum_i B^i * z_i
        //     w := 1 + sum_i B^i * w_i
        //
        // Let m denote the foreign modulus. Define:
        //      sum_x := sum_i (B^i % m) * x_i
        //      sum_y := sum_i (B^i % m) * y_i
        //      sum_z := sum_i (B^i % m) * z_i
        //      sum_w := sum_i (B^i % m) * w_i
        //      sum_xw := sum_i sum_j (B^{i+j} % m) * x_i * w_j
        //
        // Equation x * (1 + s * w) = y + z (mod m), after expanding and rearranging can
        // be expressed as:
        //
        // (1 + s) * sum_x + s * (sum_w + sum_xw) - sum_y - sum_z + (s-1) = k * m
        // <=>
        // LHS = k * m   (over the integers)
        //
        // This equation over the integers can be enforced modulo the native modulus p
        // with the following constraints:
        //
        // LHS = (u + k_min) * m   (mod p),
        // LHS = u * (m % mj) + (k_min * m) % mj + (vj + lj_min) * mj   (mod p), ∀.mj

        let limbs_max = vec![&base - BI::one(); nb_limbs as usize];
        let limbs_max_sqrd_val = (&base - BI::one()).pow(2);
        let limbs_max_sqrd = vec![limbs_max_sqrd_val.clone(); (nb_limbs * nb_limbs) as usize];

        let max_sum = sum_bigints(&bs, &limbs_max);
        let max_sum_sqrd = sum_bigints(&bs_sqrd, &limbs_max_sqrd);

        // Abuse notation and let S := max_sum and S² := max_sum_sqrd:
        //
        // We can bound the LHS as follows:
        // If s = +1, LHS is in the range [-(2 * S),           3 * S + S²]
        // If s = -1, LHS is in the range [-(2 * S + S² + 2),         - 2]
        //
        // Union range:                   [-(2 * S + S² + 2),  3 * S + S²]
        let expr_min = -(BI::from(2) * &max_sum + &max_sum_sqrd + BI::from(2));
        let expr_max = BI::from(3) * &max_sum + &max_sum_sqrd;
        let expr_bounds = (expr_min, expr_max);

        let expr_mj_bounds: Vec<_> = moduli
            .iter()
            .map(|mj| {
                let bs_mj = bs.iter().map(|b| b.rem(mj)).collect::<Vec<_>>();
                let bs_sqrd_mj = bs_sqrd.iter().map(|b| b.rem(mj)).collect::<Vec<_>>();

                let max_sum_mj = sum_bigints(&bs_mj, &limbs_max);
                let max_sum_sqrd_mj = sum_bigints(&bs_sqrd_mj, &limbs_max_sqrd);

                let expr_min_mj = -(BI::from(2) * &max_sum_mj + &max_sum_sqrd_mj + BI::from(2));
                let expr_max_mj = BI::from(3) * &max_sum_mj + &max_sum_sqrd_mj;
                (expr_min_mj, expr_max_mj)
            })
            .collect();

        get_identity_auxiliary_bounds::<F, C::Base>(
            "addition",
            &moduli,
            expr_bounds,
            &expr_mj_bounds,
            nb_parallel_range_checks,
            max_bit_len,
        )
    }

    /// Configures the custom gate.
    pub fn configure<F, P>(
        meta: &mut ConstraintSystem<F>,
        field_chip_config: &FieldChipConfig,
        sign_col: Column<Fixed>,
        nb_parallel_range_checks: usize,
        max_bit_len: u32,
    ) -> AdditionConfig<C>
    where
        F: CircuitField,
        P: FieldEmulationParams<F, C::Base>,
    {
        let m = &C::Base::modulus().to_bigint().unwrap();
        let moduli = P::moduli();
        let bs = P::base_powers();
        let bs_sqrd = P::double_base_powers();

        let ((k_min, u_max), vs_bounds) =
            Self::bounds::<F, P>(nb_parallel_range_checks, max_bit_len);

        let q = meta.selector();

        // The layout is in three rows:
        // | x_0 ... x_k | w_0    ... w_k |
        // | y_0 ... y_k |                |  <-- selector enabled here (`sign` too)
        // | z_0 ... z_k | u v_0  ... v_l |

        meta.create_gate("Foreign-Edwards addition", |meta| {
            let x_limbs = get_advice_vec(meta, &field_chip_config.x_cols, Rotation::prev());
            let y_limbs = get_advice_vec(meta, &field_chip_config.x_cols, Rotation::cur());
            let z_limbs = get_advice_vec(meta, &field_chip_config.x_cols, Rotation::next());
            let w_limbs = get_advice_vec(meta, &field_chip_config.z_cols, Rotation::prev());
            let u = meta.query_advice(field_chip_config.u_col, Rotation::next());
            let vs = get_advice_vec(meta, &field_chip_config.v_cols, Rotation::next());
            let s = meta.query_fixed(sign_col, Rotation::cur());

            let xw_limbs = pair_wise_prod(&x_limbs, &w_limbs);

            // (1 + s) * sum_x + s * (sum_w + sum_xw) - sum_y - sum_z + (s-1)
            //  = (u + k_min) * m
            let native_id = (Expression::from(1) + s.clone()) * sum_exprs::<F>(&bs, &x_limbs)
                + s.clone() * (sum_exprs::<F>(&bs, &w_limbs) + sum_exprs::<F>(&bs_sqrd, &xw_limbs))
                - sum_exprs::<F>(&bs, &y_limbs)
                - sum_exprs::<F>(&bs, &z_limbs)
                + s.clone()
                - Expression::from(1)
                - (&u + Expression::Constant(bigint_to_fe::<F>(&k_min)))
                    * Expression::Constant(bigint_to_fe::<F>(m));

            let mut moduli_ids = moduli
                .iter()
                .zip(vs)
                .zip(vs_bounds.iter())
                .map(|((mj, vj), vj_bounds)| {
                    let bs_mj = bs.iter().map(|b| b.rem(mj)).collect::<Vec<_>>();
                    let bs_sqrd_mj = bs_sqrd.iter().map(|b| b.rem(mj)).collect::<Vec<_>>();
                    let (lj_min, _) = vj_bounds;

                    let xw_limbs_mj = pair_wise_prod(&x_limbs, &w_limbs);

                    (Expression::from(1) + s.clone()) * sum_exprs::<F>(&bs_mj, &x_limbs)
                        + s.clone()
                            * (sum_exprs::<F>(&bs_mj, &w_limbs)
                                + sum_exprs::<F>(&bs_sqrd_mj, &xw_limbs_mj))
                        - sum_exprs::<F>(&bs_mj, &y_limbs)
                        - sum_exprs::<F>(&bs_mj, &z_limbs)
                        + s.clone()
                        - Expression::from(1)
                        - &u * Expression::Constant(bigint_to_fe::<F>(&urem(m, mj)))
                        - Expression::Constant(bigint_to_fe::<F>(&urem(&(&k_min * m), mj)))
                        - (vj + Expression::Constant(bigint_to_fe::<F>(lj_min)))
                            * Expression::Constant(bigint_to_fe::<F>(mj))
                })
                .collect::<Vec<_>>();

            moduli_ids.push(native_id);

            Constraints::with_selector(q, moduli_ids)
        });

        AdditionConfig {
            q,
            sign_col,
            u_bounds: (k_min, u_max),
            vs_bounds,
            _marker: PhantomData,
        }
    }
}

/// Asserts the addition identity `x * (1 ± w) = y + z (mod m)`.
///
/// When `negate_w` is `false`, asserts `x * (1 + w) = y + z`.
/// When `negate_w` is `true`,  asserts `x * (1 - w) = y + z`.
//
// This is a gate for Edwards point addition. The same identity is invoked
// twice per addition: once for the x-coordinate and once for the
// y-coordinate of the result, with different assignments to `x, y, z, w`.
//
// This identity models both coordinates of the complete addition formula on
// twisted Edwards curves:
// `(Rx,Ry) = (Px,Py) + (Qx,Qy)`
// `<=>`
// `Rx * (1 + d * Px * Py * Qx * Qy) = Px * Qy + Py * Qx`
// and
// `Ry * (1 - d * Px * Py * Qx * Qy) = Py * Qy - a * Px * Qx`.
#[allow(clippy::type_complexity, clippy::too_many_arguments)]
pub fn assert_addition_coordinate<F, C, P, N>(
    layouter: &mut impl Layouter<F>,
    x: &AssignedField<F, C::Base, P>,
    y: &AssignedField<F, C::Base, P>,
    z: &AssignedField<F, C::Base, P>,
    w: &AssignedField<F, C::Base, P>,
    negate_w: bool,
    base_chip: &FieldChip<F, C::Base, P, N>,
    addition_config: &AdditionConfig<C>,
) -> Result<(), Error>
where
    F: CircuitField,
    C: CircuitCurve,
    P: FieldEmulationParams<F, C::Base>,
    N: NativeInstructions<F>,
{
    let m = &C::Base::modulus().to_bigint().unwrap();
    let moduli = P::moduli();
    let bs = P::base_powers();
    let bs_sqrd = P::double_base_powers();
    let field_chip_config = base_chip.config();

    let x_norm = &base_chip.normalize(layouter, x)?;
    let y_norm = &base_chip.normalize(layouter, y)?;
    let z_norm = &base_chip.normalize(layouter, z)?;
    let w_norm = &base_chip.normalize(layouter, w)?;

    let sign: BI = if negate_w { -BI::one() } else { BI::one() };
    let sx_coeff = BI::one() + &sign; // 2 or 0
    let const_offset = &sign - BI::one(); // 0 or -2

    let range_checks = layouter.assign_region(
        || "Foreign-Edwards addition",
        |mut region| {
            let xs_val = x_norm.bigint_limbs();
            let ys_val = y_norm.bigint_limbs();
            let zs_val = z_norm.bigint_limbs();
            let ws_val = w_norm.bigint_limbs();
            let xw_val = xs_val.clone().zip(ws_val.clone()).map(|(x, w)| pair_wise_prod(&x, &w));

            let (k_min, u_max) = addition_config.u_bounds.clone();

            // (1 + s) * sum_x + s * (sum_w + sum_xw) - sum_y - sum_z + (s-1)
            //   = (u + k_min) * m
            let w_term = ws_val.clone().map(|v| sum_bigints(&bs, &v))
                + xw_val.clone().map(|v| sum_bigints(&bs_sqrd, &v));
            let expr = xs_val.clone().map(|v| &sx_coeff * sum_bigints(&bs, &v))
                + w_term.map(|v| &sign * v)
                - ys_val.clone().map(|v| sum_bigints(&bs, &v))
                - zs_val.clone().map(|v| sum_bigints(&bs, &v))
                + Value::known(const_offset.clone());

            let u = expr.map(|e| compute_u(m, &e, (&k_min, &u_max), Value::unknown()));

            let vs_values =
                moduli.iter().zip(addition_config.vs_bounds.iter()).map(|(mj, vj_bounds)| {
                    let bs_mj = bs.iter().map(|b| b.rem(mj)).collect::<Vec<_>>();
                    let bs_sqrd_mj = bs_sqrd.iter().map(|b| b.rem(mj)).collect::<Vec<_>>();
                    let (lj_min, vj_max) = vj_bounds.clone();

                    let w_term_mj = ws_val.clone().map(|v| sum_bigints(&bs_mj, &v))
                        + xw_val.clone().map(|v| sum_bigints(&bs_sqrd_mj, &v));
                    let expr_mj = xs_val.clone().map(|v| &sx_coeff * sum_bigints(&bs_mj, &v))
                        + w_term_mj.map(|v| &sign * v)
                        - ys_val.clone().map(|v| sum_bigints(&bs_mj, &v))
                        - zs_val.clone().map(|v| sum_bigints(&bs_mj, &v))
                        + Value::known(const_offset.clone());

                    expr_mj.zip(u.clone()).map(|(e, u)| {
                        compute_vj(m, mj, &e, &u, &k_min, (&lj_min, &vj_max), Value::unknown())
                    })
                });

            let x_limbs = x_norm.limb_values();
            let y_limbs = y_norm.limb_values();
            let z_limbs = z_norm.limb_values();
            let w_limbs = w_norm.limb_values();

            // The layout is in three rows:
            // | x_0 ... x_k | w_0    ... w_k |
            // | y_0 ... y_k |                |  <-- selector enabled here (`sign` too)
            // | z_0 ... z_k | u v_0  ... v_l |

            let mut offset = 0;

            // 1st row
            x_limbs
                .iter()
                .zip(field_chip_config.x_cols.iter())
                .map(|(cell, &col)| {
                    cell.copy_advice(|| "Edwards.addition x", &mut region, col, offset)
                })
                .collect::<Result<Vec<_>, _>>()?;

            w_limbs
                .iter()
                .zip(field_chip_config.z_cols.iter())
                .map(|(cell, &col)| {
                    cell.copy_advice(|| "Edwards.addition w", &mut region, col, offset)
                })
                .collect::<Result<Vec<_>, _>>()?;

            offset += 1;

            // 2nd row
            addition_config.q.enable(&mut region, offset)?;
            let sign_fe = if negate_w { -F::ONE } else { F::ONE };
            region.assign_fixed(
                || "Edwards.addition sign",
                addition_config.sign_col,
                offset,
                || Value::known(sign_fe),
            )?;

            y_limbs
                .iter()
                .zip(field_chip_config.x_cols.iter())
                .map(|(cell, &col)| {
                    cell.copy_advice(|| "Edwards.addition y", &mut region, col, offset)
                })
                .collect::<Result<Vec<_>, _>>()?;

            offset += 1;

            // 3rd row
            z_limbs
                .iter()
                .zip(field_chip_config.x_cols.iter())
                .map(|(cell, &col)| {
                    cell.copy_advice(|| "Edwards.addition z", &mut region, col, offset)
                })
                .collect::<Result<Vec<_>, _>>()?;

            let u_value = u.clone().map(|u| bigint_to_fe::<F>(&u));
            let u_cell = region.assign_advice(
                || "Edwards.addition u",
                field_chip_config.u_col,
                offset,
                || u_value,
            )?;

            let vs_cells = vs_values
                .zip(field_chip_config.v_cols.iter())
                .map(|(vj, &col)| {
                    let vj_value = vj.map(|vj| bigint_to_fe::<F>(&vj));
                    region.assign_advice(|| "Edwards.addition vj", col, offset, || vj_value)
                })
                .collect::<Result<Vec<_>, _>>()?;

            // u_cell will be range-checked in [0, u_max)
            let u_range_check = (u_cell, u_max);

            let vs_max = addition_config.vs_bounds.iter().map(|(_, vj_max)| vj_max.clone());

            // Every vj_cell will be range-checked in [0, vj_max)
            let vs_range_checks = vs_cells.into_iter().zip(vs_max);

            // Assert all range-checks
            Ok([u_range_check].into_iter().chain(vs_range_checks).collect::<Vec<_>>())
        },
    )?;

    range_checks.iter().try_for_each(|(cell, ubound)| {
        base_chip
            .native_gadget
            .assert_lower_than_fixed(layouter, cell, ubound.magnitude())
    })
}