Remove U+202f characters from docs (#7416)

Author: eddyashton

doc/architecture/node_to_node.rst

@@ -28,32 +28,32 @@ The following diagram shows how this key-exchange protocol executes when a new n
 .. mermaid::
 
     sequenceDiagram
-        participant Primary as Primary (P)
-        participant Backup as Backup (B)
+        participant Primary as Primary (P)
+        participant Backup as Backup (B)
 
-        Backup->>+Primary: Join request over TLS
-        Note over Primary: Consortium trusts backup
-        Primary-->>+Backup: Service identity S = {S_priv, S_pub} over TLS
+        Backup->>+Primary: Join request over TLS
+        Note over Primary: Consortium trusts backup
+        Primary-->>+Backup: Service identity S = {S_priv, S_pub} over TLS
 
-        Primary->>+Backup: key_exchange_init: {P's public key share} <br> signed with P's node cert (endorsed by S)
+        Primary->>+Backup: key_exchange_init: {P's public key share} <br> signed with P's node cert (endorsed by S)
 
-        Note over Backup: Verifies endorsement of P's cert with S_pub <br> Verifies signature with P's cert
+        Note over Backup: Verifies endorsement of P's cert with S_pub <br> Verifies signature with P's cert
 
-        Backup->>+Primary: key_exchange_response: {B's public key share + P's public key share}  <br>  signed with B's node cert (endorsed by S)
+        Backup->>+Primary: key_exchange_response: {B's public key share + P's public key share}  <br>  signed with B's node cert (endorsed by S)
 
-        Note over Primary: Verifies endorsement of B's cert with S_pub <br> verifies signature with B's cert
+        Note over Primary: Verifies endorsement of B's cert with S_pub <br> verifies signature with B's cert
 
-        Note over Primary: Derives channel send and recv keys from shared secret
+        Note over Primary: Derives channel send and recv keys from shared secret
 
-        Primary->>+Backup: key_exchange_final: {P's public key share + B's public key share}  <br> signed with P's node cert (endorsed by S)
+        Primary->>+Backup: key_exchange_final: {P's public key share + B's public key share}  <br> signed with P's node cert (endorsed by S)
 
-        Note over Backup: Verifies endorsement of P's cert with S_pub <br> Verifies signature with P's cert
+        Note over Backup: Verifies endorsement of P's cert with S_pub <br> Verifies signature with P's cert
 
-        Note over Backup: Derives channel send and recv keys from shared secret
+        Note over Backup: Derives channel send and recv keys from shared secret
 
         Note over Primary, Backup: Node-to-node channel between P and B is now established
 
-        Primary->>+Backup: Consensus headers message (e.g. replication) <br> (integrity protected with channel key)
+        Primary->>+Backup: Consensus headers message (e.g. replication) <br> (integrity protected with channel key)
         Backup->>+Primary: Consensus headers response
 
         Backup->>+Primary: Forwarded client HTTP request <br> (encrypted with channel key)
@@ -81,11 +81,11 @@ The brief sequence diagram of a successful key exchange is as follows.
 .. mermaid::
 
     sequenceDiagram
-        participant Node1 as Node1 (A)
-        participant Node2 as Node2 (B)
+        participant Node1 as Node1 (A)
+        participant Node2 as Node2 (B)
 
         Note over Node1: state := Initiated
-        Node1->>+Node2: key_exchange_init
+        Node1->>+Node2: key_exchange_init
 
         Note over Node2: state := WaitingForFinal
         Node2->>+Node1: key_exchange_response
@@ -100,16 +100,16 @@ However, if messages are dropped this protocol can reach various deadlocked stat
 .. mermaid::
 
     sequenceDiagram
-        participant N1 as Node 1
-        participant Node1 as Node1 Channel
-        participant Node2 as Node2 Channel
-        participant N2 as Node 2
+        participant N1 as Node 1
+        participant Node1 as Node1 Channel
+        participant Node2 as Node2 Channel
+        participant N2 as Node 2
 
         N1 ->>+ Node1: send(2, M)
         Note over Node1: state := Initiated
 
         alt init dropped
-            Node1 --x Node2: init
+            Node1 --x Node2: init
 
             rect rgba(200, 10, 10, .5)
                 N2 ->>+ Node2: send(1, N)
@@ -118,7 +118,7 @@ However, if messages are dropped this protocol can reach various deadlocked stat
                 Note over Node1: Ignored if lower-priority
             end
         else init delivered
-            Node1-->>+Node2: init
+            Node1-->>+Node2: init
             Note over Node2: state := WaitingForFinal
 
             alt response dropped
@@ -131,7 +131,7 @@ However, if messages are dropped this protocol can reach various deadlocked stat
 
                 rect rgba(200, 10, 10, .5)
                     N1 ->>+ Node1: send(2, M)
-                    Node1-->>+Node2: init
+                    Node1-->>+Node2: init
                     Note over Node2: Ignored due to WaitingForFinal
                 end
             else response delivered