sonobe-fs 0.1.0-alpha.1

Traits and implementations of folding schemes for the Sonobe library
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

//! Traits that define in-circuit gadgets for folding scheme algorithms, mainly
//! for proof verification.

use ark_relations::gr1cs::SynthesisError;
use sonobe_primitives::{commitments::CommitmentDefGadget, transcripts::TranscriptGadget};

use super::{FoldingSchemeDefGadget, algorithms::FoldingSchemeOps};

/// [`FoldingSchemePartialVerifierGadget`] is the partial in-circuit verifier.
///
/// For schemes that have circuit-unfriendly parts in their verification, the
/// implementation can choose to only implement this partial verifier gadget and
/// use some other techniques for the remaining verification work.
/// For example, group-based folding schemes can defer the expensive elliptic
/// curve operations on commitments to an external CycleFold circuit.
pub trait FoldingSchemePartialVerifierGadget<const M: usize, const N: usize>:
    FoldingSchemeDefGadget<Widget: FoldingSchemeOps<M, N>>
{
    /// [`FoldingSchemePartialVerifierGadget::verify_hinted`] defines the proof
    /// verification gadget that matches its out-of-circuit widget
    /// [`crate::FoldingSchemeVerifier::verify`].
    ///
    /// The implementation is allowed to create hints for the missing parts of
    /// the verification that are not performed inside the constraint system,
    /// and it is unnecessary to constrain these hints inside the circuit.
    /// However, it is the caller's responsibility to ensure that these hints
    /// are later verified using other techniques (e.g., CycleFold helper).
    #[allow(non_snake_case)]
    fn verify_hinted(
        vk: &Self::VerifierKey,
        transcript: &mut impl TranscriptGadget<<Self::CM as CommitmentDefGadget>::ConstraintField>,
        Us: [&Self::RU; M],
        us: [&Self::IU; N],
        proof: &Self::Proof<M, N>,
    ) -> Result<Self::RU, SynthesisError>;
}

/// [`FoldingSchemeFullVerifierGadget`] is the full in-circuit verifier.
///
/// Extends [`FoldingSchemePartialVerifierGadget`] by performing everything
/// required for proof verification inside the constraint system.
pub trait FoldingSchemeFullVerifierGadget<const M: usize, const N: usize>:
    FoldingSchemePartialVerifierGadget<M, N>
{
    /// [`FoldingSchemeFullVerifierGadget::verify`] defines the proof
    /// verification gadget that matches its out-of-circuit widget
    /// [`crate::FoldingSchemeVerifier::verify`].
    ///
    /// Unlike [`FoldingSchemePartialVerifierGadget::verify_hinted`], the
    /// implementation is expected to perform all necessary verification steps
    /// and constrain all required variables inside the circuit.
    #[allow(non_snake_case)]
    fn verify(
        vk: &Self::VerifierKey,
        transcript: &mut impl TranscriptGadget<<Self::CM as CommitmentDefGadget>::ConstraintField>,
        Us: [&Self::RU; M],
        us: [&Self::IU; N],
        proof: &Self::Proof<M, N>,
    ) -> Result<Self::RU, SynthesisError>;
}