[docs] Center Align (#3830)

Author: patrick-ogrady

docs/blogs/phone-a-friend.html

@@ -284,10 +284,10 @@ <h3 id="a-first-attempt">A First Attempt</h3>
         pairings.</p>
         <h2 id="our-approach">Our Approach</h2>
         <p>We start from a simple observation:</p>
-        <blockquote>
+        <div data-align="center">
         <p><em>A perfectly correct encryption scheme is also a perfectly
         binding commitment scheme</em></p>
-        </blockquote>
+        </div>
         <p>If a helper provides us the message <em>and</em> randomness
         used to create the ciphertext, we can avoid the decryption
         equation check entirely. Instead, we can check that the
@@ -532,13 +532,13 @@ <h3 id="simple-bte-as-a-witness-encryption-scheme">Simple BTE as
         [k_1\tau^{B+1}]_T+m_1,\ldots,[k_B\tau^{B+1}]_T+m_B
         \right).
         \]</span></p>
-        <blockquote>
+        <div data-align="center">
         <p>This is precisely the batch of ciphertexts together with the
         partial decryption in the simple-BTE scheme! Thus the users and
         the committee produce the ciphertext <span
         class="math inline">\(\mathsf{ct}\)</span> in a
         <em>distributed</em> manner.</p>
-        </blockquote>
+        </div>
         <p><strong>Decrypt:</strong> To decrypt the <span
         class="math inline">\(i\)</span>-th ciphertext, we use <span
         class="math inline">\(\{h_{\ell+B+1-i}\}_{\ell\in[0,B]\setminus\{i\}}\)</span>

docs/blogs/phone-a-friend.md

@@ -103,7 +103,11 @@ So if all ciphertexts use the same witness, the verifier can fold pairings acros
 
 We start from a simple observation:
 
-> *A perfectly correct encryption scheme is also a perfectly binding commitment scheme*
+<div align="center">
+
+*A perfectly correct encryption scheme is also a perfectly binding commitment scheme*
+
+</div>
 
 If a helper provides us the message *and* randomness used to create the ciphertext, we can avoid the decryption equation check entirely. Instead, we can check that the ciphertext is a valid encryption of the claimed message under the claimed randomness. In the linear WE notation above, this means checking:
 
@@ -286,7 +290,11 @@ $$
 \right).
 $$
 
-> This is precisely the batch of ciphertexts together with the partial decryption in the simple-BTE scheme! Thus the users and the committee produce the ciphertext $\mathsf{ct}$ in a *distributed* manner.
+<div align="center">
+
+This is precisely the batch of ciphertexts together with the partial decryption in the simple-BTE scheme! Thus the users and the committee produce the ciphertext $\mathsf{ct}$ in a *distributed* manner.
+
+</div>
 
 **Decrypt:** To decrypt the $i$-th ciphertext, we use $\{h_{\ell+B+1-i}\}_{\ell\in[0,B]\setminus\{i\}}$ as the witness which is readily available in the public parameters.
   $$

docs/style.css

@@ -82,6 +82,10 @@ p {
     margin-bottom: 5px;
 }
 
+div[data-align="center"] {
+    text-align: center;
+}
+
 button {
     padding: 5px;
     margin-bottom: 5px;
@@ -383,6 +387,20 @@ details.podcast-episode summary.podcast-title {
     padding-bottom: 0.25rem;
 }
 
+/* Avoid subpixel seams between KaTeX's stitched stretchy brace pieces. */
+.katex .brace-left {
+    width: 25.4%;
+}
+
+.katex .brace-center {
+    left: 24.8%;
+    width: 50.4%;
+}
+
+.katex .brace-right {
+    width: 25.4%;
+}
+
 /* MCP page styles */
 #tool-selector {
     margin: 20px 0;