sp1_prover/
types.rs

1use std::{fs::File, path::Path};
2
3use anyhow::Result;
4use clap::ValueEnum;
5use p3_baby_bear::BabyBear;
6use p3_bn254_fr::Bn254Fr;
7use p3_commit::{Pcs, TwoAdicMultiplicativeCoset};
8use p3_field::{AbstractField, PrimeField, PrimeField32, TwoAdicField};
9use serde::{de::DeserializeOwned, Deserialize, Serialize};
10use sp1_core_machine::{io::SP1Stdin, reduce::SP1ReduceProof};
11use sp1_primitives::{io::SP1PublicValues, poseidon2_hash};
12
13use sp1_recursion_circuit::machine::{
14    SP1CompressWitnessValues, SP1DeferredWitnessValues, SP1RecursionWitnessValues,
15};
16
17use sp1_recursion_gnark_ffi::proof::{Groth16Bn254Proof, PlonkBn254Proof};
18
19use sp1_stark::{ShardProof, StarkGenericConfig, StarkProvingKey, StarkVerifyingKey, DIGEST_SIZE};
20use thiserror::Error;
21
22use crate::{
23    utils::{babybears_to_bn254, words_to_bytes_be},
24    CoreSC, InnerSC,
25};
26
27/// The information necessary to generate a proof for a given RISC-V program.
28#[derive(Clone, Serialize, Deserialize)]
29pub struct SP1ProvingKey {
30    pub pk: StarkProvingKey<CoreSC>,
31    pub elf: Vec<u8>,
32    /// Verifying key is also included as we need it for recursion
33    pub vk: SP1VerifyingKey,
34}
35
36/// The information necessary to verify a proof for a given RISC-V program.
37#[derive(Clone, Serialize, Deserialize)]
38pub struct SP1VerifyingKey {
39    pub vk: StarkVerifyingKey<CoreSC>,
40}
41
42/// A trait for keys that can be hashed into a digest.
43pub trait HashableKey {
44    /// Hash the key into a digest of BabyBear elements.
45    fn hash_babybear(&self) -> [BabyBear; DIGEST_SIZE];
46
47    /// Hash the key into a digest of u32 elements.
48    fn hash_u32(&self) -> [u32; DIGEST_SIZE];
49
50    /// Hash the key into a Bn254Fr element.
51    fn hash_bn254(&self) -> Bn254Fr {
52        babybears_to_bn254(&self.hash_babybear())
53    }
54
55    /// Hash the key into a 32 byte hex string, prefixed with "0x".
56    ///
57    /// This is ideal for generating a vkey hash for onchain verification.
58    fn bytes32(&self) -> String {
59        let vkey_digest_bn254 = self.hash_bn254();
60        format!("0x{:0>64}", vkey_digest_bn254.as_canonical_biguint().to_str_radix(16))
61    }
62
63    /// Hash the key into a 32 byte array.
64    ///
65    /// This has the same value as `bytes32`, but as a raw byte array.
66    fn bytes32_raw(&self) -> [u8; 32] {
67        let vkey_digest_bn254 = self.hash_bn254();
68        let vkey_bytes = vkey_digest_bn254.as_canonical_biguint().to_bytes_be();
69        let mut result = [0u8; 32];
70        result[1..].copy_from_slice(&vkey_bytes);
71        result
72    }
73
74    /// Hash the key into a digest of bytes elements.
75    fn hash_bytes(&self) -> [u8; DIGEST_SIZE * 4] {
76        words_to_bytes_be(&self.hash_u32())
77    }
78}
79
80impl HashableKey for SP1VerifyingKey {
81    fn hash_babybear(&self) -> [BabyBear; DIGEST_SIZE] {
82        self.vk.hash_babybear()
83    }
84
85    fn hash_u32(&self) -> [u32; DIGEST_SIZE] {
86        self.vk.hash_u32()
87    }
88}
89
90impl<SC: StarkGenericConfig<Val = BabyBear, Domain = TwoAdicMultiplicativeCoset<BabyBear>>>
91    HashableKey for StarkVerifyingKey<SC>
92where
93    <SC::Pcs as Pcs<SC::Challenge, SC::Challenger>>::Commitment: AsRef<[BabyBear; DIGEST_SIZE]>,
94{
95    fn hash_babybear(&self) -> [BabyBear; DIGEST_SIZE] {
96        let mut num_inputs = DIGEST_SIZE + 1 + 14 + (7 * self.chip_information.len());
97        for (name, _, _) in self.chip_information.iter() {
98            num_inputs += name.len();
99        }
100        let mut inputs = Vec::with_capacity(num_inputs);
101        inputs.extend(self.commit.as_ref());
102        inputs.push(self.pc_start);
103        inputs.extend(self.initial_global_cumulative_sum.0.x.0);
104        inputs.extend(self.initial_global_cumulative_sum.0.y.0);
105        for (name, domain, dimension) in self.chip_information.iter() {
106            inputs.push(BabyBear::from_canonical_usize(domain.log_n));
107            let size = 1 << domain.log_n;
108            inputs.push(BabyBear::from_canonical_usize(size));
109            let g = BabyBear::two_adic_generator(domain.log_n);
110            inputs.push(domain.shift);
111            inputs.push(g);
112            inputs.push(BabyBear::from_canonical_usize(dimension.width));
113            inputs.push(BabyBear::from_canonical_usize(dimension.height));
114            inputs.push(BabyBear::from_canonical_usize(name.len()));
115            for byte in name.as_bytes() {
116                inputs.push(BabyBear::from_canonical_u8(*byte));
117            }
118        }
119
120        poseidon2_hash(inputs)
121    }
122
123    fn hash_u32(&self) -> [u32; 8] {
124        self.hash_babybear()
125            .into_iter()
126            .map(|n| n.as_canonical_u32())
127            .collect::<Vec<_>>()
128            .try_into()
129            .unwrap()
130    }
131}
132
133/// A proof of a RISCV ELF execution with given inputs and outputs.
134#[derive(Serialize, Deserialize, Clone)]
135#[serde(bound(serialize = "P: Serialize"))]
136#[serde(bound(deserialize = "P: DeserializeOwned"))]
137pub struct SP1ProofWithMetadata<P: Clone> {
138    pub proof: P,
139    pub stdin: SP1Stdin,
140    pub public_values: SP1PublicValues,
141    pub cycles: u64,
142}
143
144impl<P: Serialize + DeserializeOwned + Clone> SP1ProofWithMetadata<P> {
145    pub fn save(&self, path: impl AsRef<Path>) -> Result<()> {
146        bincode::serialize_into(File::create(path).expect("failed to open file"), self)
147            .map_err(Into::into)
148    }
149
150    pub fn load(path: impl AsRef<Path>) -> Result<Self> {
151        bincode::deserialize_from(File::open(path).expect("failed to open file"))
152            .map_err(Into::into)
153    }
154}
155
156impl<P: std::fmt::Debug + Clone> std::fmt::Debug for SP1ProofWithMetadata<P> {
157    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
158        f.debug_struct("SP1ProofWithMetadata").field("proof", &self.proof).finish()
159    }
160}
161
162/// A proof of an SP1 program without any wrapping.
163pub type SP1CoreProof = SP1ProofWithMetadata<SP1CoreProofData>;
164
165/// An SP1 proof that has been recursively reduced into a single proof. This proof can be verified
166/// within SP1 programs.
167pub type SP1ReducedProof = SP1ProofWithMetadata<SP1ReducedProofData>;
168
169/// An SP1 proof that has been wrapped into a single PLONK proof and can be verified onchain.
170pub type SP1PlonkBn254Proof = SP1ProofWithMetadata<SP1PlonkBn254ProofData>;
171
172/// An SP1 proof that has been wrapped into a single Groth16 proof and can be verified onchain.
173pub type SP1Groth16Bn254Proof = SP1ProofWithMetadata<SP1Groth16Bn254ProofData>;
174
175/// An SP1 proof that has been wrapped into a single proof and can be verified onchain.
176pub type SP1Proof = SP1ProofWithMetadata<SP1Bn254ProofData>;
177
178#[derive(Serialize, Deserialize, Clone)]
179pub struct SP1CoreProofData(pub Vec<ShardProof<CoreSC>>);
180
181#[derive(Serialize, Deserialize, Clone)]
182pub struct SP1ReducedProofData(pub ShardProof<InnerSC>);
183
184#[derive(Serialize, Deserialize, Clone)]
185pub struct SP1PlonkBn254ProofData(pub PlonkBn254Proof);
186
187#[derive(Serialize, Deserialize, Clone)]
188pub struct SP1Groth16Bn254ProofData(pub Groth16Bn254Proof);
189
190#[derive(Serialize, Deserialize, Clone)]
191pub enum SP1Bn254ProofData {
192    Plonk(PlonkBn254Proof),
193    Groth16(Groth16Bn254Proof),
194}
195
196impl SP1Bn254ProofData {
197    pub fn get_proof_system(&self) -> ProofSystem {
198        match self {
199            SP1Bn254ProofData::Plonk(_) => ProofSystem::Plonk,
200            SP1Bn254ProofData::Groth16(_) => ProofSystem::Groth16,
201        }
202    }
203
204    pub fn get_raw_proof(&self) -> &str {
205        match self {
206            SP1Bn254ProofData::Plonk(proof) => &proof.raw_proof,
207            SP1Bn254ProofData::Groth16(proof) => &proof.raw_proof,
208        }
209    }
210}
211
212/// The mode of the prover.
213#[derive(Debug, Default, Clone, ValueEnum, PartialEq, Eq)]
214pub enum ProverMode {
215    #[default]
216    Cpu,
217    Cuda,
218    Network,
219    Mock,
220}
221
222#[derive(Debug, Clone, Copy, PartialEq, Eq)]
223pub enum ProofSystem {
224    Plonk,
225    Groth16,
226}
227
228impl ProofSystem {
229    pub fn as_str(&self) -> &'static str {
230        match self {
231            ProofSystem::Plonk => "Plonk",
232            ProofSystem::Groth16 => "Groth16",
233        }
234    }
235}
236
237/// A proof that can be reduced along with other proofs into one proof.
238#[derive(Serialize, Deserialize, Clone)]
239pub enum SP1ReduceProofWrapper {
240    Core(SP1ReduceProof<CoreSC>),
241    Recursive(SP1ReduceProof<InnerSC>),
242}
243
244#[derive(Error, Debug)]
245pub enum SP1RecursionProverError {
246    #[error("Runtime error: {0}")]
247    RuntimeError(String),
248}
249
250#[allow(clippy::large_enum_variant)]
251pub enum SP1CircuitWitness {
252    Core(SP1RecursionWitnessValues<CoreSC>),
253    Deferred(SP1DeferredWitnessValues<InnerSC>),
254    Compress(SP1CompressWitnessValues<InnerSC>),
255}
sp1_prover/types.rs

sp1_prover/
types.rs
