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::Zero;
4use std::marker::PhantomData;
5
6use super::{CommittedInstance, Witness};
7use crate::ccs::r1cs::R1CS;
8use crate::commitment::CommitmentScheme;
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, CS: CommitmentScheme<C>> {
16 _c: PhantomData<C>,
17 _cp: PhantomData<CS>,
18}
19
20impl<C: CurveGroup, CS: CommitmentScheme<C>> NIFS<C, CS>
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>, // U_i
72 ci2: &CommittedInstance<C>, // u_i
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 cs_prover_params: &CS::ProverParams,
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=0 since we don't need hiding property for cm(T)
106 let cmT = CS::commit(cs_prover_params, &T, &C::ScalarField::zero())?;
107 Ok((T, cmT))
108 }
109 pub fn compute_cyclefold_cmT(
110 cs_prover_params: &CS::ProverParams,
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=0 since we don't need hiding property for cm(T)
126 let cmT = CS::commit(cs_prover_params, &T, &C::ScalarField::zero())?;
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=0 since we don't need hiding property for cm(T)
144 let w3 = NIFS::<C, CS>::fold_witness(r, w1, w2, T, C::ScalarField::zero())?;
145
146 // fold committed instances
147 let ci3 = NIFS::<C, CS>::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, CS>::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 cs_prover_params: &CS::ProverParams,
188 w: &Witness<C>,
189 ci: &CommittedInstance<C>,
190 T: Vec<C::ScalarField>,
191 cmT: &C,
192 ) -> Result<[CS::Proof; 3], Error> {
193 let cmE_proof = CS::prove(cs_prover_params, tr, &ci.cmE, &w.E, &w.rE, None)?;
194 let cmW_proof = CS::prove(cs_prover_params, tr, &ci.cmW, &w.W, &w.rW, None)?;
195 let cmT_proof = CS::prove(cs_prover_params, tr, cmT, &T, &C::ScalarField::zero(), None)?; // cm(T) is committed with rT=0
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<C>() -> (
217 PedersenParams<C>,
218 PoseidonConfig<C::ScalarField>,
219 R1CS<C::ScalarField>,
220 Witness<C>, // w1
221 CommittedInstance<C>, // ci1
222 Witness<C>, // w2
223 CommittedInstance<C>, // ci2
224 Witness<C>, // w3
225 CommittedInstance<C>, // ci3
226 Vec<C::ScalarField>, // T
227 C, // cmT
228 Vec<bool>, // r_bits
229 C::ScalarField, // r_Fr
230 )
231 where
232 C: CurveGroup,
233 <C as CurveGroup>::BaseField: PrimeField,
234 C::ScalarField: Absorb,
235 {
236 let r1cs = get_test_r1cs();
237 let z1 = get_test_z(3);
238 let z2 = get_test_z(4);
239 let (w1, x1) = r1cs.split_z(&z1);
240 let (w2, x2) = r1cs.split_z(&z2);
241
242 let w1 = Witness::<C>::new(w1.clone(), r1cs.A.n_rows);
243 let w2 = Witness::<C>::new(w2.clone(), r1cs.A.n_rows);
244
245 let mut rng = ark_std::test_rng();
246 let (pedersen_params, _) = Pedersen::<C>::setup(&mut rng, r1cs.A.n_cols).unwrap();
247
248 // compute committed instances
249 let ci1 = w1
250 .commit::<Pedersen<C>>(&pedersen_params, x1.clone())
251 .unwrap();
252 let ci2 = w2
253 .commit::<Pedersen<C>>(&pedersen_params, x2.clone())
254 .unwrap();
255
256 // NIFS.P
257 let (T, cmT) =
258 NIFS::<C, Pedersen<C>>::compute_cmT(&pedersen_params, &r1cs, &w1, &ci1, &w2, &ci2)
259 .unwrap();
260
261 let poseidon_config = poseidon_test_config::<C::ScalarField>();
262
263 let r_bits = ChallengeGadget::<C>::get_challenge_native(
264 &poseidon_config,
265 ci1.clone(),
266 ci2.clone(),
267 cmT,
268 )
269 .unwrap();
270 let r_Fr = C::ScalarField::from_bigint(BigInteger::from_bits_le(&r_bits)).unwrap();
271
272 let (w3, ci3) =
273 NIFS::<C, Pedersen<C>>::fold_instances(r_Fr, &w1, &ci1, &w2, &ci2, &T, cmT).unwrap();
274
275 (
276 pedersen_params,
277 poseidon_config,
278 r1cs,
279 w1,
280 ci1,
281 w2,
282 ci2,
283 w3,
284 ci3,
285 T,
286 cmT,
287 r_bits,
288 r_Fr,
289 )
290 }
291
292 // fold 2 dummy instances and check that the folded instance holds the relaxed R1CS relation
293 #[test]
294 fn test_nifs_fold_dummy() {
295 let r1cs = get_test_r1cs::<Fr>();
296 let z1 = get_test_z(3);
297 let (w1, x1) = r1cs.split_z(&z1);
298
299 let mut rng = ark_std::test_rng();
300 let (pedersen_params, _) = Pedersen::<Projective>::setup(&mut rng, r1cs.A.n_cols).unwrap();
301
302 // dummy instance, witness and public inputs zeroes
303 let w_dummy = Witness::<Projective>::new(vec![Fr::zero(); w1.len()], r1cs.A.n_rows);
304 let mut u_dummy = w_dummy
305 .commit::<Pedersen<Projective>>(&pedersen_params, vec![Fr::zero(); x1.len()])
306 .unwrap();
307 u_dummy.u = Fr::zero();
308
309 let w_i = w_dummy.clone();
310 let u_i = u_dummy.clone();
311 let W_i = w_dummy.clone();
312 let U_i = u_dummy.clone();
313 r1cs.check_relaxed_instance_relation(&w_i, &u_i).unwrap();
314 r1cs.check_relaxed_instance_relation(&W_i, &U_i).unwrap();
315
316 let r_Fr = Fr::from(3_u32);
317
318 let (T, cmT) = NIFS::<Projective, Pedersen<Projective>>::compute_cmT(
319 &pedersen_params,
320 &r1cs,
321 &w_i,
322 &u_i,
323 &W_i,
324 &U_i,
325 )
326 .unwrap();
327 let (W_i1, U_i1) = NIFS::<Projective, Pedersen<Projective>>::fold_instances(
328 r_Fr, &w_i, &u_i, &W_i, &U_i, &T, cmT,
329 )
330 .unwrap();
331 r1cs.check_relaxed_instance_relation(&W_i1, &U_i1).unwrap();
332 }
333
334 // fold 2 instances into one
335 #[test]
336 fn test_nifs_one_fold() {
337 let (pedersen_params, poseidon_config, r1cs, w1, ci1, w2, ci2, w3, ci3, T, cmT, _, r) =
338 prepare_simple_fold_inputs();
339
340 // NIFS.V
341 let ci3_v = NIFS::<Projective, Pedersen<Projective>>::verify(r, &ci1, &ci2, &cmT);
342 assert_eq!(ci3_v, ci3);
343
344 // check that relations hold for the 2 inputted instances and the folded one
345 r1cs.check_relaxed_instance_relation(&w1, &ci1).unwrap();
346 r1cs.check_relaxed_instance_relation(&w2, &ci2).unwrap();
347 r1cs.check_relaxed_instance_relation(&w3, &ci3).unwrap();
348
349 // check that folded commitments from folded instance (ci) are equal to folding the
350 // use folded rE, rW to commit w3
351 let ci3_expected = w3
352 .commit::<Pedersen<Projective>>(&pedersen_params, ci3.x.clone())
353 .unwrap();
354 assert_eq!(ci3_expected.cmE, ci3.cmE);
355 assert_eq!(ci3_expected.cmW, ci3.cmW);
356
357 // next equalities should hold since we started from two cmE of zero-vector E's
358 assert_eq!(ci3.cmE, cmT.mul(r));
359 assert_eq!(w3.E, vec_scalar_mul(&T, &r));
360
361 // NIFS.Verify_Folded_Instance:
362 NIFS::<Projective, Pedersen<Projective>>::verify_folded_instance(r, &ci1, &ci2, &ci3, &cmT)
363 .unwrap();
364
365 // init Prover's transcript
366 let mut transcript_p = PoseidonTranscript::<Projective>::new(&poseidon_config);
367 // init Verifier's transcript
368 let mut transcript_v = PoseidonTranscript::<Projective>::new(&poseidon_config);
369
370 // prove the ci3.cmE, ci3.cmW, cmT commitments
371 let cm_proofs = NIFS::<Projective, Pedersen<Projective>>::prove_commitments(
372 &mut transcript_p,
373 &pedersen_params,
374 &w3,
375 &ci3,
376 T,
377 &cmT,
378 )
379 .unwrap();
380
381 // verify the ci3.cmE, ci3.cmW, cmT commitments
382 assert_eq!(cm_proofs.len(), 3);
383 Pedersen::<Projective>::verify(
384 &pedersen_params,
385 &mut transcript_v,
386 &ci3.cmE,
387 &cm_proofs[0].clone(),
388 )
389 .unwrap();
390 Pedersen::<Projective>::verify(
391 &pedersen_params,
392 &mut transcript_v,
393 &ci3.cmW,
394 &cm_proofs[1].clone(),
395 )
396 .unwrap();
397 Pedersen::<Projective>::verify(
398 &pedersen_params,
399 &mut transcript_v,
400 &cmT,
401 &cm_proofs[2].clone(),
402 )
403 .unwrap();
404 }
405
406 #[test]
407 fn test_nifs_fold_loop() {
408 let r1cs = get_test_r1cs();
409 let z = get_test_z(3);
410 let (w, x) = r1cs.split_z(&z);
411
412 let mut rng = ark_std::test_rng();
413 let (pedersen_params, _) = Pedersen::<Projective>::setup(&mut rng, r1cs.A.n_cols).unwrap();
414
415 // prepare the running instance
416 let mut running_instance_w = Witness::<Projective>::new(w.clone(), r1cs.A.n_rows);
417 let mut running_committed_instance = running_instance_w
418 .commit::<Pedersen<Projective>>(&pedersen_params, x)
419 .unwrap();
420
421 r1cs.check_relaxed_instance_relation(&running_instance_w, &running_committed_instance)
422 .unwrap();
423
424 let num_iters = 10;
425 for i in 0..num_iters {
426 // prepare the incoming instance
427 let incoming_instance_z = get_test_z(i + 4);
428 let (w, x) = r1cs.split_z(&incoming_instance_z);
429 let incoming_instance_w = Witness::<Projective>::new(w.clone(), r1cs.A.n_rows);
430 let incoming_committed_instance = incoming_instance_w
431 .commit::<Pedersen<Projective>>(&pedersen_params, x)
432 .unwrap();
433 r1cs.check_relaxed_instance_relation(
434 &incoming_instance_w,
435 &incoming_committed_instance,
436 )
437 .unwrap();
438
439 let r = Fr::rand(&mut rng); // folding challenge would come from the RO
440
441 // NIFS.P
442 let (T, cmT) = NIFS::<Projective, Pedersen<Projective>>::compute_cmT(
443 &pedersen_params,
444 &r1cs,
445 &running_instance_w,
446 &running_committed_instance,
447 &incoming_instance_w,
448 &incoming_committed_instance,
449 )
450 .unwrap();
451 let (folded_w, _) = NIFS::<Projective, Pedersen<Projective>>::fold_instances(
452 r,
453 &running_instance_w,
454 &running_committed_instance,
455 &incoming_instance_w,
456 &incoming_committed_instance,
457 &T,
458 cmT,
459 )
460 .unwrap();
461
462 // NIFS.V
463 let folded_committed_instance = NIFS::<Projective, Pedersen<Projective>>::verify(
464 r,
465 &running_committed_instance,
466 &incoming_committed_instance,
467 &cmT,
468 );
469
470 r1cs.check_relaxed_instance_relation(&folded_w, &folded_committed_instance)
471 .unwrap();
472
473 // set running_instance for next loop iteration
474 running_instance_w = folded_w;
475 running_committed_instance = folded_committed_instance;
476 }
477 }
478}