Lower trace length

evm_arithmetization/src/all_stark.rs

@@ -126,9 +126,9 @@ impl Table {
     pub(crate) const fn all_sorted() -> [Self; NUM_TABLES] {
         [
             Self::Memory,
+            Self::Cpu,
             Self::MemBefore,
             Self::MemAfter,
-            Self::Cpu,
             Self::Arithmetic,
             Self::BytePacking,
             Self::Logic,
@@ -140,7 +140,7 @@ impl Table {
     /// Returns the ordered position of the tables. This is the inverse of
     /// `all_sorted()`.
     pub(crate) const fn table_to_sorted_index() -> [usize; NUM_TABLES] {
-        [4, 5, 3, 7, 8, 6, 0, 1, 2]
+        [4, 5, 1, 7, 8, 6, 0, 2, 3]
     }
 
     /// Returns the ordered position of the tables in a batch Merkle tree. Each
@@ -149,19 +149,19 @@ impl Table {
         [
             (0, 0),
             (1, 0),
-            (1, 1),
             (2, 0),
             (2, 1),
-            (2, 2),
-            (2, 3),
             (3, 0),
+            (3, 1),
+            (3, 2),
+            (3, 3),
             (4, 0),
         ]
     }
 
     /// Returns all STARK padded trace degrees in descending order.
     pub(crate) const fn all_degree_logs() -> [usize; NUM_TABLES] {
-        [23, 22, 22, 20, 20, 20, 20, 18, 16]
+        [23, 20, 18, 18, 16, 16, 16, 16, 14]
     }
 }
 

evm_arithmetization/src/prover.rs

@@ -95,7 +95,7 @@ pub(crate) fn zkevm_fast_config() -> StarkConfig {
             proof_of_work_bits: 16,
             // This strategy allows us to hit all intermediary STARK leaves while going through the
             // batched Field Merkle Trees.
-            reduction_strategy: FriReductionStrategy::Fixed(vec![1, 2, 2, 2, 4, 4, 4]),
+            reduction_strategy: FriReductionStrategy::Fixed(vec![3, 2, 2, 2, 4, 4, 2]),
             num_query_rounds: 84,
         },
     }