fixes

AztecProtocol · Nov 16, 2023 · d8e6b79 · d8e6b79
1 parent b114b39
commit d8e6b79
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/barretenberg/cpp/src/barretenberg/ecc/pippenger.md b/barretenberg/cpp/src/barretenberg/ecc/pippenger.md
@@ -1,12 +1,12 @@
-# Implement cahe-optimized, parallelisable pippenger implementation 
+# Implement cache-optimized, parallelizable pippenger implementation 
 
 ## The problem 
 
 Pippenger's algorithm for batched scalar multiplications is the fastest known algorithm for computing a large number of scalar multiplications, with a run time of `O(n / logn)`, where `n` is the number of points being multiplied. 
 
 We currently have pippenger implemented in barretenberg, which can process a scalar multiplication in ~4 micro-seconds (for large batches).
 
-However, the algorithm, as it stands, is not parallelisable, due to the highly non-sequential memory access patterns.
+However, the algorithm, as it stands, is not parallelizable, due to the highly non-sequential memory access patterns.
 
 ## The algorithm 
 

diff --git a/docs/docs/concepts/advanced/data_structures/trees.md b/docs/docs/concepts/advanced/data_structures/trees.md
@@ -131,7 +131,7 @@ If a function of a smart contract generates this Nullifier and submits it to the
 
 We've found that such notes require an 'Initialization Nullifier'; a nullifier which, when emitted, signals the initialization of this state variable. I.e. the very first time the state variable has been written-to.
 
-> There's more on this topic in [the Aztec forum](https://discourse.aztec.network/t/utxo-syntax-2-initializing-singleton-utxos/47).
+> There's more on this topic in [the Aztec forum](https://discourse.aztec.network/t/utxo-syntax-2-initialising-singleton-utxos/47).
 
 ## Public State Tree