Fix typos (#1780)

Author: rex4539

bin/mpt-test/src/circuit/state_update.rs

@@ -57,13 +57,13 @@ pub struct StateUpdateCircuitConfig<F: Field> {
     /// The MPT table, where the state updates are stored
     pub pi_mpt: MptTable,
 
-    /// Intance column, used to check public inputs
+    /// Instance column, used to check public inputs
     pub instance: Column<Instance>,
 
     /// ONE if the first row, ZERO otherwise
     pub is_first: Column<Fixed>,
 
-    /// ONE if row is paddding, ZERO otherwise
+    /// ONE if row is padding, ZERO otherwise
     pub is_padding: IsZeroConfig<F>,
 
     /// ONE is the last used row, ZERO otherwise
@@ -465,7 +465,7 @@ impl<F: Field> Circuit<F> for StateUpdateCircuit<F> {
                                 ).unwrap()
                             );
 
-                    // at beggining, set the old root and number of proofs
+                    // at beginning, set the old root and number of proofs
 
                     if offset == 0 {
                         pi.push(Some(old_root_lo));

bus-mapping/README.md

@@ -158,7 +158,7 @@ On that way, we would get something like this for the Memory ops:
 | `key`  | `val`         | `rw`    | `gc` | Note                                     |
 |:------:| ------------- | ------- | ---- | ---------------------------------------- |
 | `0x40` | `0`           | `Write` |      | Init                                     |
-| `0x40` | `0x80`        | `Write` | 0    | Assume written at the begining of `code` |
+| `0x40` | `0x80`        | `Write` | 0    | Assume written at the beginning of `code`|
 | `0x40` | `0x80`        | `Read`  | 4    | `56 MLOAD`                               |
 |   -    |               |         |      |                                          |
 | `0x80` | `0`           | `Write` |      | Init                                     |

bus-mapping/src/circuit_input_builder.rs

@@ -84,7 +84,7 @@ impl FeatureConfig {
 #[derive(Debug, Clone, Copy)]
 pub struct FixedCParams {
     /// Maximum number of rw operations in the state circuit (RwTable length /
-    /// nummber of rows). This must be at least the number of rw operations
+    /// number of rows). This must be at least the number of rw operations
     /// + 1, in order to allocate at least a Start row.
     pub max_rws: usize,
     // TODO: evm_rows: Maximum number of rows in the EVM Circuit
@@ -190,7 +190,7 @@ pub struct CircuitInputBuilder<C: CircuitsParams> {
     pub code_db: CodeDB,
     /// Block
     pub block: Block,
-    /// Circuits Setup Paramteres
+    /// Circuits Setup Parameters
     pub circuits_params: C,
     /// Block Context
     pub block_ctx: BlockContext,
@@ -544,7 +544,7 @@ pub fn keccak_inputs(block: &Block, code_db: &CodeDB) -> Result<Vec<Vec<u8>>, Er
 }
 
 /// Generate the keccak inputs required by the SignVerify Chip from the
-/// signature datas.
+/// signature data.
 pub fn keccak_inputs_sign_verify(sigs: &[SignData]) -> Vec<Vec<u8>> {
     let mut inputs = Vec::new();
     for sig in sigs {

bus-mapping/src/circuit_input_builder/block.rs

@@ -60,7 +60,7 @@ pub struct Block {
     /// chain id
     pub chain_id: Word,
     /// history hashes contains most recent 256 block hashes in history, where
-    /// the lastest one is at history_hashes[history_hashes.len() - 1].
+    /// the latest one is at history_hashes[history_hashes.len() - 1].
     pub history_hashes: Vec<Word>,
     /// coinbase
     pub coinbase: Address,

bus-mapping/src/circuit_input_builder/call.rs

@@ -63,7 +63,7 @@ pub struct Call {
     pub kind: CallKind,
     /// This call is being executed without write access (STATIC)
     pub is_static: bool,
-    /// This call generated implicity by a Transaction.
+    /// This call generated implicitly by a Transaction.
     pub is_root: bool,
     /// This call is persistent or call stack reverts at some point
     pub is_persistent: bool,

bus-mapping/src/circuit_input_builder/execution.rs

@@ -337,7 +337,7 @@ impl From<(Word, Word, Word)> for ExpStep {
     }
 }
 
-/// Event representating an exponentiation `a ^ b == d (mod 2^256)`.
+/// Event representing an exponentiation `a ^ b == d (mod 2^256)`.
 #[derive(Clone, Debug)]
 pub struct ExpEvent {
     /// Identifier for the exponentiation trace.

bus-mapping/src/circuit_input_builder/tracer_tests.rs

@@ -146,7 +146,7 @@ fn check_err_depth(step: &GethExecStep, next_step: Option<&GethExecStep>) -> boo
 
 #[test]
 fn tracer_err_depth() {
-    // Recursive CALL will exaust the call depth
+    // Recursive CALL will exhaust the call depth
     let code = bytecode! {
              PUSH1(0x0) // retLength
              PUSH1(0x0) // retOffset

bus-mapping/src/error.rs

@@ -105,7 +105,7 @@ pub enum OogError {
     SelfDestruct,
 }
 
-// Given OpCodeId, returns correponding OogError.
+// Given OpCodeId, returns corresponding OogError.
 impl From<&OpcodeId> for OogError {
     fn from(op: &OpcodeId) -> Self {
         match op {

bus-mapping/src/evm/opcodes/callop.rs

@@ -170,7 +170,7 @@ impl<const N_ARGS: usize> Opcode for CallOpcode<N_ARGS> {
         // read balance of caller to compare to value for insufficient_balance checking
         // in circuit, also use for callcode successful case check balance is
         // indeed larger than transfer value. for call opcode, it does in
-        // tranfer gadget implicitly.
+        // transfer gadget implicitly.
         state.account_read(
             &mut exec_step,
             call.caller_address,

bus-mapping/src/evm/opcodes/error_write_protection.rs

@@ -44,7 +44,7 @@ impl Opcode for ErrorWriteProtection {
         .contains(&geth_step.op));
 
         if geth_step.op == OpcodeId::CALL {
-            // get only the frist three stack elements since the third one is the value we
+            // get only the first three stack elements since the third one is the value we
             // want to check.
             for i in 0..3 {
                 state.stack_read(