sonobe/folding-schemes/src/folding/nova/nifs.rs
folding-schemes/src/folding/nova/nifs.rsRaw
1use ark_crypto_primitives::sponge::Absorb;
2use ark_ec::{CurveGroup, Group};
3use ark_std::One;
4use std::marker::PhantomData;
5
6use super::{CommittedInstance, Witness};
7use crate::ccs::r1cs::R1CS;
8use crate::commitment::CommitmentProver;
9use crate::transcript::Transcript;
10use crate::utils::vec::*;
11use crate::Error;
12
13/// Implements the Non-Interactive Folding Scheme described in section 4 of
14/// [Nova](https://eprint.iacr.org/2021/370.pdf)
15pub struct NIFS<C: CurveGroup, CP: CommitmentProver<C>> {
16 _c: PhantomData<C>,
17 _cp: PhantomData<CP>,
18}
19
20impl<C: CurveGroup, CP: CommitmentProver<C>> NIFS<C, CP>
21where
22 <C as Group>::ScalarField: Absorb,
23{
24 // compute_T: compute cross-terms T
25 pub fn compute_T(
26 r1cs: &R1CS<C::ScalarField>,
27 u1: C::ScalarField,
28 u2: C::ScalarField,
29 z1: &[C::ScalarField],
30 z2: &[C::ScalarField],
31 ) -> Result<Vec<C::ScalarField>, Error> {
32 let (A, B, C) = (r1cs.A.clone(), r1cs.B.clone(), r1cs.C.clone());
33
34 // this is parallelizable (for the future)
35 let Az1 = mat_vec_mul_sparse(&A, z1)?;
36 let Bz1 = mat_vec_mul_sparse(&B, z1)?;
37 let Cz1 = mat_vec_mul_sparse(&C, z1)?;
38 let Az2 = mat_vec_mul_sparse(&A, z2)?;
39 let Bz2 = mat_vec_mul_sparse(&B, z2)?;
40 let Cz2 = mat_vec_mul_sparse(&C, z2)?;
41
42 let Az1_Bz2 = hadamard(&Az1, &Bz2)?;
43 let Az2_Bz1 = hadamard(&Az2, &Bz1)?;
44 let u1Cz2 = vec_scalar_mul(&Cz2, &u1);
45 let u2Cz1 = vec_scalar_mul(&Cz1, &u2);
46
47 vec_sub(&vec_sub(&vec_add(&Az1_Bz2, &Az2_Bz1)?, &u1Cz2)?, &u2Cz1)
48 }
49
50 pub fn fold_witness(
51 r: C::ScalarField,
52 w1: &Witness<C>,
53 w2: &Witness<C>,
54 T: &[C::ScalarField],
55 rT: C::ScalarField,
56 ) -> Result<Witness<C>, Error> {
57 let r2 = r * r;
58 let E: Vec<C::ScalarField> = vec_add(
59 &vec_add(&w1.E, &vec_scalar_mul(T, &r))?,
60 &vec_scalar_mul(&w2.E, &r2),
61 )?;
62 let rE = w1.rE + r * rT + r2 * w2.rE;
63 let W: Vec<C::ScalarField> = w1.W.iter().zip(&w2.W).map(|(a, b)| *a + (r * b)).collect();
64
65 let rW = w1.rW + r * w2.rW;
66 Ok(Witness::<C> { E, rE, W, rW })
67 }
68
69 pub fn fold_committed_instance(
70 r: C::ScalarField,
71 ci1: &CommittedInstance<C>,
72 ci2: &CommittedInstance<C>,
73 cmT: &C,
74 ) -> CommittedInstance<C> {
75 let r2 = r * r;
76 let cmE = ci1.cmE + cmT.mul(r) + ci2.cmE.mul(r2);
77 let u = ci1.u + r * ci2.u;
78 let cmW = ci1.cmW + ci2.cmW.mul(r);
79 let x = ci1
80 .x
81 .iter()
82 .zip(&ci2.x)
83 .map(|(a, b)| *a + (r * b))
84 .collect::<Vec<C::ScalarField>>();
85
86 CommittedInstance::<C> { cmE, u, cmW, x }
87 }
88
89 /// NIFS.P is the consecutive combination of compute_cmT with fold_instances
90
91 /// compute_cmT is part of the NIFS.P logic
92 pub fn compute_cmT(
93 cm_prover_params: &CP::Params,
94 r1cs: &R1CS<C::ScalarField>,
95 w1: &Witness<C>,
96 ci1: &CommittedInstance<C>,
97 w2: &Witness<C>,
98 ci2: &CommittedInstance<C>,
99 ) -> Result<(Vec<C::ScalarField>, C), Error> {
100 let z1: Vec<C::ScalarField> = [vec![ci1.u], ci1.x.to_vec(), w1.W.to_vec()].concat();
101 let z2: Vec<C::ScalarField> = [vec![ci2.u], ci2.x.to_vec(), w2.W.to_vec()].concat();
102
103 // compute cross terms
104 let T = Self::compute_T(r1cs, ci1.u, ci2.u, &z1, &z2)?;
105 // use r_T=1 since we don't need hiding property for cm(T)
106 let cmT = CP::commit(cm_prover_params, &T, &C::ScalarField::one())?;
107 Ok((T, cmT))
108 }
109 pub fn compute_cyclefold_cmT(
110 cm_prover_params: &CP::Params,
111 r1cs: &R1CS<C::ScalarField>, // R1CS over C2.Fr=C1.Fq (here C=C2)
112 w1: &Witness<C>,
113 ci1: &CommittedInstance<C>,
114 w2: &Witness<C>,
115 ci2: &CommittedInstance<C>,
116 ) -> Result<(Vec<C::ScalarField>, C), Error>
117 where
118 <C as ark_ec::CurveGroup>::BaseField: ark_ff::PrimeField,
119 {
120 let z1: Vec<C::ScalarField> = [vec![ci1.u], ci1.x.to_vec(), w1.W.to_vec()].concat();
121 let z2: Vec<C::ScalarField> = [vec![ci2.u], ci2.x.to_vec(), w2.W.to_vec()].concat();
122
123 // compute cross terms
124 let T = Self::compute_T(r1cs, ci1.u, ci2.u, &z1, &z2)?;
125 // use r_T=1 since we don't need hiding property for cm(T)
126 let cmT = CP::commit(cm_prover_params, &T, &C::ScalarField::one())?;
127 Ok((T, cmT))
128 }
129
130 /// fold_instances is part of the NIFS.P logic described in
131 /// [Nova](https://eprint.iacr.org/2021/370.pdf)'s section 4. It returns the folded Committed
132 /// Instances and the Witness.
133 pub fn fold_instances(
134 r: C::ScalarField,
135 w1: &Witness<C>,
136 ci1: &CommittedInstance<C>,
137 w2: &Witness<C>,
138 ci2: &CommittedInstance<C>,
139 T: &[C::ScalarField],
140 cmT: C,
141 ) -> Result<(Witness<C>, CommittedInstance<C>), Error> {
142 // fold witness
143 // use r_T=1 since we don't need hiding property for cm(T)
144 let w3 = NIFS::<C, CP>::fold_witness(r, w1, w2, T, C::ScalarField::one())?;
145
146 // fold committed instances
147 let ci3 = NIFS::<C, CP>::fold_committed_instance(r, ci1, ci2, &cmT);
148
149 Ok((w3, ci3))
150 }
151
152 /// verify implements NIFS.V logic described in [Nova](https://eprint.iacr.org/2021/370.pdf)'s
153 /// section 4. It returns the folded Committed Instance
154 pub fn verify(
155 // r comes from the transcript, and is a n-bit (N_BITS_CHALLENGE) element
156 r: C::ScalarField,
157 ci1: &CommittedInstance<C>,
158 ci2: &CommittedInstance<C>,
159 cmT: &C,
160 ) -> CommittedInstance<C> {
161 NIFS::<C, CP>::fold_committed_instance(r, ci1, ci2, cmT)
162 }
163
164 /// Verify committed folded instance (ci) relations. Notice that this method does not open the
165 /// commitments, but just checks that the given committed instances (ci1, ci2) when folded
166 /// result in the folded committed instance (ci3) values.
167 pub fn verify_folded_instance(
168 r: C::ScalarField,
169 ci1: &CommittedInstance<C>,
170 ci2: &CommittedInstance<C>,
171 ci3: &CommittedInstance<C>,
172 cmT: &C,
173 ) -> Result<(), Error> {
174 let expected = Self::fold_committed_instance(r, ci1, ci2, cmT);
175 if ci3.cmE != expected.cmE
176 || ci3.u != expected.u
177 || ci3.cmW != expected.cmW
178 || ci3.x != expected.x
179 {
180 return Err(Error::NotSatisfied);
181 }
182 Ok(())
183 }
184
185 pub fn prove_commitments(
186 tr: &mut impl Transcript<C>,
187 cm_prover_params: &CP::Params,
188 w: &Witness<C>,
189 ci: &CommittedInstance<C>,
190 T: Vec<C::ScalarField>,
191 cmT: &C,
192 ) -> Result<[CP::Proof; 3], Error> {
193 let cmE_proof = CP::prove(cm_prover_params, tr, &ci.cmE, &w.E, &w.rE, None)?;
194 let cmW_proof = CP::prove(cm_prover_params, tr, &ci.cmW, &w.W, &w.rW, None)?;
195 let cmT_proof = CP::prove(cm_prover_params, tr, cmT, &T, &C::ScalarField::one(), None)?; // cm(T) is committed with rT=1
196 Ok([cmE_proof, cmW_proof, cmT_proof])
197 }
198}
199
200#[cfg(test)]
201pub mod tests {
202 use super::*;
203 use ark_crypto_primitives::sponge::poseidon::PoseidonConfig;
204 use ark_ff::{BigInteger, PrimeField};
205 use ark_pallas::{Fr, Projective};
206 use ark_std::{ops::Mul, UniformRand, Zero};
207
208 use crate::ccs::r1cs::tests::{get_test_r1cs, get_test_z};
209 use crate::commitment::pedersen::{Params as PedersenParams, Pedersen};
210 use crate::folding::nova::circuits::ChallengeGadget;
211 use crate::folding::nova::traits::NovaR1CS;
212 use crate::transcript::poseidon::{poseidon_test_config, PoseidonTranscript};
213 use crate::utils::vec::vec_scalar_mul;
214
215 #[allow(clippy::type_complexity)]
216 pub(crate) fn prepare_simple_fold_inputs() -> (
217 PedersenParams<Projective>,
218 PoseidonConfig<Fr>,
219 R1CS<Fr>,
220 Witness<Projective>, // w1
221 CommittedInstance<Projective>, // ci1
222 Witness<Projective>, // w2
223 CommittedInstance<Projective>, // ci2
224 Witness<Projective>, // w3
225 CommittedInstance<Projective>, // ci3
226 Vec<Fr>, // T
227 Projective, // cmT
228 Vec<bool>, // r_bits
229 Fr, // r_Fr
230 ) {
231 let r1cs = get_test_r1cs();
232 let z1 = get_test_z(3);
233 let z2 = get_test_z(4);
234 let (w1, x1) = r1cs.split_z(&z1);
235 let (w2, x2) = r1cs.split_z(&z2);
236
237 let w1 = Witness::<Projective>::new(w1.clone(), r1cs.A.n_rows);
238 let w2 = Witness::<Projective>::new(w2.clone(), r1cs.A.n_rows);
239
240 let mut rng = ark_std::test_rng();
241 let pedersen_params = Pedersen::<Projective>::new_params(&mut rng, r1cs.A.n_cols);
242
243 // compute committed instances
244 let ci1 = w1
245 .commit::<Pedersen<Projective>>(&pedersen_params, x1.clone())
246 .unwrap();
247 let ci2 = w2
248 .commit::<Pedersen<Projective>>(&pedersen_params, x2.clone())
249 .unwrap();
250
251 // NIFS.P
252 let (T, cmT) = NIFS::<Projective, Pedersen<Projective>>::compute_cmT(
253 &pedersen_params,
254 &r1cs,
255 &w1,
256 &ci1,
257 &w2,
258 &ci2,
259 )
260 .unwrap();
261
262 let poseidon_config = poseidon_test_config::<Fr>();
263
264 let r_bits = ChallengeGadget::<Projective>::get_challenge_native(
265 &poseidon_config,
266 ci1.clone(),
267 ci2.clone(),
268 cmT,
269 )
270 .unwrap();
271 let r_Fr = Fr::from_bigint(BigInteger::from_bits_le(&r_bits)).unwrap();
272
273 let (w3, ci3) = NIFS::<Projective, Pedersen<Projective>>::fold_instances(
274 r_Fr, &w1, &ci1, &w2, &ci2, &T, cmT,
275 )
276 .unwrap();
277
278 (
279 pedersen_params,
280 poseidon_config,
281 r1cs,
282 w1,
283 ci1,
284 w2,
285 ci2,
286 w3,
287 ci3,
288 T,
289 cmT,
290 r_bits,
291 r_Fr,
292 )
293 }
294
295 // fold 2 dummy instances and check that the folded instance holds the relaxed R1CS relation
296 #[test]
297 fn test_nifs_fold_dummy() {
298 let r1cs = get_test_r1cs::<Fr>();
299 let z1 = get_test_z(3);
300 let (w1, x1) = r1cs.split_z(&z1);
301
302 let mut rng = ark_std::test_rng();
303 let pedersen_params = Pedersen::<Projective>::new_params(&mut rng, r1cs.A.n_cols);
304
305 // dummy instance, witness and public inputs zeroes
306 let w_dummy = Witness::<Projective>::new(vec![Fr::zero(); w1.len()], r1cs.A.n_rows);
307 let mut u_dummy = w_dummy
308 .commit::<Pedersen<Projective>>(&pedersen_params, vec![Fr::zero(); x1.len()])
309 .unwrap();
310 u_dummy.u = Fr::zero();
311
312 let w_i = w_dummy.clone();
313 let u_i = u_dummy.clone();
314 let W_i = w_dummy.clone();
315 let U_i = u_dummy.clone();
316 r1cs.check_relaxed_instance_relation(&w_i, &u_i).unwrap();
317 r1cs.check_relaxed_instance_relation(&W_i, &U_i).unwrap();
318
319 let r_Fr = Fr::from(3_u32);
320
321 let (T, cmT) = NIFS::<Projective, Pedersen<Projective>>::compute_cmT(
322 &pedersen_params,
323 &r1cs,
324 &w_i,
325 &u_i,
326 &W_i,
327 &U_i,
328 )
329 .unwrap();
330 let (W_i1, U_i1) = NIFS::<Projective, Pedersen<Projective>>::fold_instances(
331 r_Fr, &w_i, &u_i, &W_i, &U_i, &T, cmT,
332 )
333 .unwrap();
334 r1cs.check_relaxed_instance_relation(&W_i1, &U_i1).unwrap();
335 }
336
337 // fold 2 instances into one
338 #[test]
339 fn test_nifs_one_fold() {
340 let (pedersen_params, poseidon_config, r1cs, w1, ci1, w2, ci2, w3, ci3, T, cmT, _, r) =
341 prepare_simple_fold_inputs();
342
343 // NIFS.V
344 let ci3_v = NIFS::<Projective, Pedersen<Projective>>::verify(r, &ci1, &ci2, &cmT);
345 assert_eq!(ci3_v, ci3);
346
347 // check that relations hold for the 2 inputted instances and the folded one
348 r1cs.check_relaxed_instance_relation(&w1, &ci1).unwrap();
349 r1cs.check_relaxed_instance_relation(&w2, &ci2).unwrap();
350 r1cs.check_relaxed_instance_relation(&w3, &ci3).unwrap();
351
352 // check that folded commitments from folded instance (ci) are equal to folding the
353 // use folded rE, rW to commit w3
354 let ci3_expected = w3
355 .commit::<Pedersen<Projective>>(&pedersen_params, ci3.x.clone())
356 .unwrap();
357 assert_eq!(ci3_expected.cmE, ci3.cmE);
358 assert_eq!(ci3_expected.cmW, ci3.cmW);
359
360 // next equalities should hold since we started from two cmE of zero-vector E's
361 assert_eq!(ci3.cmE, cmT.mul(r));
362 assert_eq!(w3.E, vec_scalar_mul(&T, &r));
363
364 // NIFS.Verify_Folded_Instance:
365 NIFS::<Projective, Pedersen<Projective>>::verify_folded_instance(r, &ci1, &ci2, &ci3, &cmT)
366 .unwrap();
367
368 // init Prover's transcript
369 let mut transcript_p = PoseidonTranscript::<Projective>::new(&poseidon_config);
370 // init Verifier's transcript
371 let mut transcript_v = PoseidonTranscript::<Projective>::new(&poseidon_config);
372
373 // prove the ci3.cmE, ci3.cmW, cmT commitments
374 let cm_proofs = NIFS::<Projective, Pedersen<Projective>>::prove_commitments(
375 &mut transcript_p,
376 &pedersen_params,
377 &w3,
378 &ci3,
379 T,
380 &cmT,
381 )
382 .unwrap();
383
384 // verify the ci3.cmE, ci3.cmW, cmT commitments
385 assert_eq!(cm_proofs.len(), 3);
386 Pedersen::<Projective>::verify(
387 &pedersen_params,
388 &mut transcript_v,
389 ci3.cmE,
390 cm_proofs[0].clone(),
391 )
392 .unwrap();
393 Pedersen::<Projective>::verify(
394 &pedersen_params,
395 &mut transcript_v,
396 ci3.cmW,
397 cm_proofs[1].clone(),
398 )
399 .unwrap();
400 Pedersen::<Projective>::verify(
401 &pedersen_params,
402 &mut transcript_v,
403 cmT,
404 cm_proofs[2].clone(),
405 )
406 .unwrap();
407 }
408
409 #[test]
410 fn test_nifs_fold_loop() {
411 let r1cs = get_test_r1cs();
412 let z = get_test_z(3);
413 let (w, x) = r1cs.split_z(&z);
414
415 let mut rng = ark_std::test_rng();
416 let pedersen_params = Pedersen::<Projective>::new_params(&mut rng, r1cs.A.n_cols);
417
418 // prepare the running instance
419 let mut running_instance_w = Witness::<Projective>::new(w.clone(), r1cs.A.n_rows);
420 let mut running_committed_instance = running_instance_w
421 .commit::<Pedersen<Projective>>(&pedersen_params, x)
422 .unwrap();
423
424 r1cs.check_relaxed_instance_relation(&running_instance_w, &running_committed_instance)
425 .unwrap();
426
427 let num_iters = 10;
428 for i in 0..num_iters {
429 // prepare the incoming instance
430 let incoming_instance_z = get_test_z(i + 4);
431 let (w, x) = r1cs.split_z(&incoming_instance_z);
432 let incoming_instance_w = Witness::<Projective>::new(w.clone(), r1cs.A.n_rows);
433 let incoming_committed_instance = incoming_instance_w
434 .commit::<Pedersen<Projective>>(&pedersen_params, x)
435 .unwrap();
436 r1cs.check_relaxed_instance_relation(
437 &incoming_instance_w,
438 &incoming_committed_instance,
439 )
440 .unwrap();
441
442 let r = Fr::rand(&mut rng); // folding challenge would come from the RO
443
444 // NIFS.P
445 let (T, cmT) = NIFS::<Projective, Pedersen<Projective>>::compute_cmT(
446 &pedersen_params,
447 &r1cs,
448 &running_instance_w,
449 &running_committed_instance,
450 &incoming_instance_w,
451 &incoming_committed_instance,
452 )
453 .unwrap();
454 let (folded_w, _) = NIFS::<Projective, Pedersen<Projective>>::fold_instances(
455 r,
456 &running_instance_w,
457 &running_committed_instance,
458 &incoming_instance_w,
459 &incoming_committed_instance,
460 &T,
461 cmT,
462 )
463 .unwrap();
464
465 // NIFS.V
466 let folded_committed_instance = NIFS::<Projective, Pedersen<Projective>>::verify(
467 r,
468 &running_committed_instance,
469 &incoming_committed_instance,
470 &cmT,
471 );
472
473 r1cs.check_relaxed_instance_relation(&folded_w, &folded_committed_instance)
474 .unwrap();
475
476 // set running_instance for next loop iteration
477 running_instance_w = folded_w;
478 running_committed_instance = folded_committed_instance;
479 }
480 }
481}