fix: typos

website/api/zkvm/optimization.md

@@ -168,7 +168,7 @@ it can acted on (e.g. used as input to an `add`). It must also be written back
 to memory to store the result. Memory loads and stores (i.e. reads and writes)
 usually take one cycle.
 
-Memory access, both load and store takes exactly one cycle, expect in the case
+Memory access, both load and store takes exactly one cycle, except in the case
 of page-in and page-out operations ([discussed below](#paging)).
 
 Note that relative to a physical CPU, this is extremely fast (in terms of

website/api_versioned_docs/version-0.20/zkvm/optimization.md

@@ -168,7 +168,7 @@ it can acted on (e.g. used as input to an `add`). It must also be written back
 to memory to store the result. Memory loads and stores (i.e. reads and writes)
 usually take one cycle.
 
-Memory access, both load and store takes exactly one cycle, expect in the case
+Memory access, both load and store takes exactly one cycle, except in the case
 of page-in and page-out operations ([discussed below](#paging)).
 
 Note that relative to a physical CPU, this is extremely fast (in terms of

website/api_versioned_docs/version-0.21/zkvm/optimization.md

@@ -168,7 +168,7 @@ it can acted on (e.g. used as input to an `add`). It must also be written back
 to memory to store the result. Memory loads and stores (i.e. reads and writes)
 usually take one cycle.
 
-Memory access, both load and store takes exactly one cycle, expect in the case
+Memory access, both load and store takes exactly one cycle, except in the case
 of page-in and page-out operations ([discussed below](#paging)).
 
 Note that relative to a physical CPU, this is extremely fast (in terms of

website/docs/proof-system/stark-by-hand.md

@@ -45,7 +45,7 @@ Each rule check is written as the polynomial over the data columns, for example
 In our example $a$, $b$, and $c$ may be terms in the data columns enforcing the Fibonacci sequence rule, that $F(i) + F(i+1) = F(i + 2)$.
 
 Each rule is combined with a selector from the control columns to decide when to apply the rules.
-For example, we should check that the output of one step is equal to the input to the next, expect when we consider the first row where there is no prior step and instead it must be equal to the user input.
+For example, we should check that the output of one step is equal to the input to the next, except when we consider the first row where there is no prior step and instead it must be equal to the user input.
 This combination is via multiplication e.g. $(s)(a + b - c)$ ensures that _either_ $a + b = c$ or $s = 0$.
 
 Each rule checking column can be expressed as a multi-input, single-output polynomial, where the inputs are some combination of entries in the trace; we call these `rule-checking polynomials`.