Fixed links due to renaming

Author: EmpieichO

docs/zkEVM/protocol/flow-of-assets.md

@@ -40,6 +40,6 @@ Consider now the case where a user commits to bridging some assets from L2 to L1
 
     For example, the interaction between the Consensus Contract and the Sequencer is omitted in the figure.
 
-    For a more wholistic view of the interaction between the Consensus Contract and the Sequencer, the reader is referred to earlier subsections of this documentation, specifically on the [<ins>Consensus Contract</ins>](../architecture/architecture.md).
+    For a more wholistic view of the interaction between the Consensus Contract and the Sequencer, the reader is referred to earlier subsections of this documentation, specifically on the [<ins>Consensus Contract</ins>](../architecture/index.md).
 
 ![A end-to-end flow of assets between L1 and L2](../../img/zkEVM/06pzb-complete-asset-flow-l1-l2.png)

docs/zkEVM/protocol/submit-transaction.md

@@ -1,4 +1,3 @@
-
 !!!info
     This document series describes in detail the various forms and stages that L2 users' transactions go through, from the time they are created in users' wallets to the time they are finally verified with indisputable evidence on L1.
 

docs/zkEVM/specifications/pil/configuration-files.md

@@ -4,7 +4,7 @@ In order for PIL to securely enable modularity, especially in complex settings s
 
 ## Dependency Inclusion Feature
 
-Let's consider a scenario. If the PIL code of Secondary SMs reflects unique properties such as the maximum length (for example, the length $\mathtt{2^{10}}$ of the Multiplier SM as seen in the first line of [the `multiplier.pil` code](/zkevm/PIL/pil-compile.md)), such properties can easily become magic numbers which attackers could use as distinguishers of which computation is running at a given point in time.
+Let's consider a scenario. If the PIL code of Secondary SMs reflects unique properties such as the maximum length (for example, the length $\mathtt{2^{10}}$ of the Multiplier SM as seen in the first line of [the `multiplier.pil` code](compiling-using-pilcom.md)), such properties can easily become magic numbers which attackers could use as distinguishers of which computation is running at a given point in time.
 
 This is where the **dependency inclusion feature** comes in.
 

docs/zkEVM/specifications/pil/cyclicity-in-pil.md

@@ -2,7 +2,7 @@ This document describes how to introduce cyclicity to execution traces in Polyno
 
 In order to synchronize the execution trace of a given program with the subgroup $G$ of the multiplicative group $\mathbb{F}^*$, over which interpolation is performed, an extra constant polynomial (or precompiled column) is added to the trace. 
 
-An explanation of what this group $G = \langle g \rangle$ is, and why it is naturally a cyclic group, was discussed in the [Basic Concepts](/zkevm/zkProver/mfibonacci-example.md) section of the zkProver.
+An explanation of what this group $G = \langle g \rangle$ is, and why it is naturally a cyclic group, was discussed in the [Basic Concepts](../../concepts/mfibonacci-example.md) section of the zkProver.
 
 ## Non-cyclic SM Example
 

docs/zkEVM/specifications/pil/generating-proofs.md

@@ -89,4 +89,4 @@ async function execute() {
 
 If the output of the `starkVerify` function is `true`, the proof is valid. Otherwise, the verifier should invalidate the proof sent by the prover.
 
-A `pil-stark` DIY guide is given [here](/zkevm/zkProver/pil-stark-demo.md).
+A `pil-stark` DIY guide is given [here](../../concepts/pil-stark-demo.md).

docs/zkEVM/specifications/pil/inclusion-arguments.md

@@ -217,11 +217,11 @@ $$
 \texttt{a}\ \text{ is } \textbf{contained in }\ \texttt{b}\ \text{ if for all }\ i ∈ [n],\ \text{ there exists a }\ j ∈ [m]\ \text{ such that }\ a_i = b_j.
 $$
 
-In other words, if one thinks of $\texttt{a}$ and $\texttt{b}$ as multisets and reduce them to sets (by removing the multiplicity), then $\texttt{a}$ is contained in $\texttt{b}$ if $\texttt{a}$ is a subset of $\texttt{b}$. See [this document](/zkevm/zkProver/intro-generic-sm.md) for more details on multisets and Plookup.
+In other words, if one thinks of $\texttt{a}$ and $\texttt{b}$ as multisets and reduce them to sets (by removing the multiplicity), then $\texttt{a}$ is contained in $\texttt{b}$ if $\texttt{a}$ is a subset of $\texttt{b}$. See [this document](../../concepts/intro-generic-sm.md) for more details on multisets and Plookup.
 
 A protocol $(\mathcal{P},\mathcal{V})$ is an **inclusion argument** if the protocol can be used by $\mathcal{P}$ to prove to $\mathcal{V}$ that one vector is contained in another vector. 
 
-In the PIL context, the implemented inclusion argument is the same as the $\text{Plookup}$ method provided in [[GW20](https://eprint.iacr.org/2020/315.pdf)], also discussed [here](/zkevm/zkProver/intro-generic-sm.md). Other "alternative" method exists such as the $\text{PlonkUp}$ described in [[PFM+22](https://eprint.iacr.org/2022/086.pdf)].
+In the PIL context, the implemented inclusion argument is the same as the $\text{Plookup}$ method provided in [[GW20](https://eprint.iacr.org/2020/315.pdf)], also discussed [here](../../concepts/intro-generic-sm.md). Other "alternative" method exists such as the $\text{PlonkUp}$ described in [[PFM+22](https://eprint.iacr.org/2022/086.pdf)].
 
 An inclusion argument is invoked in PIL with the "$\texttt{in}$" keyword.