Rename Constant trace -> Preprocessed trace. (#881)

crates/prover/src/examples/blake/air.rs

@@ -309,9 +309,9 @@ where
     let channel = &mut MC::C::default();
     let commitment_scheme = &mut CommitmentSchemeProver::new(config, &twiddles);
 
-    // Constant trace.
+    // Preprocessed trace.
     // TODO(ShaharS): share is_first column between components when constant columns support this.
-    let span = span!(Level::INFO, "Constant Trace").entered();
+    let span = span!(Level::INFO, "Preprocessed Trace").entered();
     let mut tree_builder = commitment_scheme.tree_builder();
     tree_builder.extend_evals(
         chain![
@@ -472,7 +472,7 @@ pub fn verify_blake<MC: MerkleChannel>(
 
     let log_sizes = stmt0.log_sizes();
 
-    // Constant trace.
+    // Preprocessed trace.
     commitment_scheme.commit(stark_proof.commitments[0], &log_sizes[0], channel);
 
     // Trace.

crates/prover/src/examples/blake/xor_table/gen.rs

@@ -42,7 +42,7 @@ pub fn generate_trace<const ELEM_BITS: u32, const EXPAND_BITS: u32>(
 }
 
 /// Generates the interaction trace for the xor table.
-/// Returns the interaction trace, the constant trace, and the claimed sum.
+/// Returns the interaction trace, the Preprocessed trace, and the claimed sum.
 #[allow(clippy::type_complexity)]
 pub fn generate_interaction_trace<const ELEM_BITS: u32, const EXPAND_BITS: u32>(
     lookup_data: XorTableLookupData<ELEM_BITS, EXPAND_BITS>,
@@ -135,13 +135,13 @@ pub fn generate_interaction_trace<const ELEM_BITS: u32, const EXPAND_BITS: u32>(
     logup_gen.finalize_last()
 }
 
-/// Generates the constant trace for the xor table.
-/// Returns the constant trace, the constant trace, and the claimed sum.
+/// Generates the Preprocessed trace for the xor table.
+/// Returns the Preprocessed trace, the Preprocessed trace, and the claimed sum.
 #[allow(clippy::type_complexity)]
 pub fn generate_constant_trace<const ELEM_BITS: u32, const EXPAND_BITS: u32>(
 ) -> ColumnVec<CircleEvaluation<SimdBackend, BaseField, BitReversedOrder>> {
     let limb_bits = limb_bits::<ELEM_BITS, EXPAND_BITS>();
-    let _span = span!(Level::INFO, "Xor constant trace").entered();
+    let _span = span!(Level::INFO, "Xor Preprocessed trace").entered();
 
     // Generate the constant columns. In reality, these should be generated before the proof
     // even began.

crates/prover/src/examples/plonk/mod.rs

@@ -198,7 +198,7 @@ pub fn prove_fibonacci_plonk(
     let commitment_scheme =
         &mut CommitmentSchemeProver::<_, Blake2sMerkleChannel>::new(config, &twiddles);
 
-    // Constant trace.
+    // Preprocessed trace.
     let span = span!(Level::INFO, "Constant").entered();
     let mut tree_builder = commitment_scheme.tree_builder();
     let is_first = gen_is_first(log_n_rows);

crates/prover/src/examples/poseidon/mod.rs

@@ -350,7 +350,7 @@ pub fn prove_poseidon(
     let commitment_scheme =
         &mut CommitmentSchemeProver::<_, Blake2sMerkleChannel>::new(config, &twiddles);
 
-    // Constant trace.
+    // Preprocessed trace.
     let span = span!(Level::INFO, "Constant").entered();
     let mut tree_builder = commitment_scheme.tree_builder();
     let constant_trace = vec![gen_is_first(log_n_rows)];

crates/prover/src/examples/state_machine/mod.rs

@@ -53,7 +53,7 @@ pub fn prove_state_machine(
     let commitment_scheme =
         &mut CommitmentSchemeProver::<_, Blake2sMerkleChannel>::new(config, &twiddles);
 
-    // Constant trace.
+    // Preprocessed trace.
     let mut tree_builder = commitment_scheme.tree_builder();
     tree_builder.extend_evals(vec![
         gen_is_first(x_axis_log_rows),