tracing instrument to level trace (#21)

Author: hero78119

crates/multilinear_extensions/src/virtual_poly.rs

@@ -329,7 +329,8 @@ pub fn build_eq_x_r_sequential<E: ExtensionField>(r: &[E]) -> ArcMultilinearExte
 
 #[tracing::instrument(
     skip_all,
-    name = "multilinear_extensions::build_eq_x_r_vec_sequential_with_scalar"
+    name = "multilinear_extensions::build_eq_x_r_vec_sequential_with_scalar",
+    level = "trace"
 )]
 pub fn build_eq_x_r_vec_sequential_with_scalar<E: ExtensionField>(r: &[E], scalar: E) -> Vec<E> {
     // avoid unnecessary allocation
@@ -354,7 +355,11 @@ pub fn build_eq_x_r_vec_sequential_with_scalar<E: ExtensionField>(r: &[E], scala
 }
 
 #[inline]
-#[tracing::instrument(skip_all, name = "multilinear_extensions::build_eq_x_r_vec_sequential")]
+#[tracing::instrument(
+    skip_all,
+    name = "multilinear_extensions::build_eq_x_r_vec_sequential",
+    level = "trace"
+)]
 pub fn build_eq_x_r_vec_sequential<E: ExtensionField>(r: &[E]) -> Vec<E> {
     build_eq_x_r_vec_sequential_with_scalar(r, E::ONE)
 }
@@ -400,7 +405,11 @@ pub fn build_eq_x_r<E: ExtensionField>(r: &[E]) -> ArcMultilinearExtension<'_, E
 /// over r, which is
 ///      eq(x,y) = \prod_i=1^num_var (x_i * r_i + (1-x_i)*(1-r_i))
 
-#[tracing::instrument(skip_all, name = "multilinear_extensions::build_eq_x_r_vec")]
+#[tracing::instrument(
+    skip_all,
+    name = "multilinear_extensions::build_eq_x_r_vec",
+    level = "trace"
+)]
 pub fn build_eq_x_r_vec<E: ExtensionField>(r: &[E]) -> Vec<E> {
     // avoid unnecessary allocation
     if r.is_empty() {
@@ -444,7 +453,8 @@ pub fn build_eq_x_r_vec<E: ExtensionField>(r: &[E]) -> Vec<E> {
 
 #[tracing::instrument(
     skip_all,
-    name = "multilinear_extensions::build_eq_x_r_vec_with_scalar"
+    name = "multilinear_extensions::build_eq_x_r_vec_with_scalar",
+    level = "trace"
 )]
 pub fn build_eq_x_r_vec_with_scalar<E: ExtensionField>(r: &[E], scalar: E) -> Vec<E> {
     // avoid unnecessary allocation

crates/sumcheck/src/prover.rs

@@ -304,7 +304,11 @@ impl<'a, E: ExtensionField> IOPProverState<'a, E> {
     /// next round.
     ///
     /// Main algorithm used is from section 3.2 of [XZZPS19](https://eprint.iacr.org/2019/317.pdf#subsection.3.2).
-    #[tracing::instrument(skip_all, name = "sumcheck::prove_round_and_update_state")]
+    #[tracing::instrument(
+        skip_all,
+        name = "sumcheck::prove_round_and_update_state",
+        level = "trace"
+    )]
     pub fn prove_round_and_update_state(
         &mut self,
         challenge: &Option<Challenge<E>>,
@@ -463,7 +467,7 @@ impl<'a, E: ExtensionField> IOPProverState<'a, E> {
 #[deprecated(note = "deprecated parallel version due to syncronizaion overhead")]
 impl<'a, E: ExtensionField> IOPProverState<'a, E> {
     /// Given a virtual polynomial, generate an IOP proof.
-    #[tracing::instrument(skip_all, name = "sumcheck::prove_parallel")]
+    #[tracing::instrument(skip_all, name = "sumcheck::prove_parallel", level = "trace")]
     pub fn prove_parallel(
         poly: VirtualPolynomial<'a, E>,
         transcript: &mut impl Transcript<E>,
@@ -555,7 +559,11 @@ impl<'a, E: ExtensionField> IOPProverState<'a, E> {
     /// next round.
     ///
     /// Main algorithm used is from section 3.2 of [XZZPS19](https://eprint.iacr.org/2019/317.pdf#subsection.3.2).
-    #[tracing::instrument(skip_all, name = "sumcheck::prove_round_and_update_state_parallel")]
+    #[tracing::instrument(
+        skip_all,
+        name = "sumcheck::prove_round_and_update_state_parallel",
+        level = "trace"
+    )]
     pub(crate) fn prove_round_and_update_state_parallel(
         &mut self,
         challenge: &Option<Challenge<E>>,