fix: typo

Author: Tu Phan

src/app/blog/block-based-shamir-secret-sharing/page.md

@@ -11,9 +11,9 @@ Block-based Shamir Secret Sharing (Blocked-based SSS) uses $\mathrm{GF}(2^8)$ as
 
 You have a secret $S$. You want:
 
-    •	Split into $n$ shares
-    •	Any $t$ shares can recover $S$
-    •	Fewer than $t$ shares reveal nothing
+- Split into $n$ shares
+- Any $t$ shares can recover $S$
+- Fewer than $t$ shares reveal nothing
 
 This is achieved with polynomials over a field.
 
@@ -100,6 +100,8 @@ $$
 
 , where $s \in \{s_1,\dots,s_k\}$ and $p \in \{p_1,\dots,p_k\}$.
 
+Finally, $S = s_1 \Vert s_2 \Vert ... \Vert s_k$.
+
 ## Take-Away
 
 Blocked-based Shamir Secret Sharing represents each secret byte as the constant term of a random polynomial over $\mathrm{GF}(2^8)$; shares are polynomial evaluations, and the secret is recovered by interpolation.