Update report/src/sections/06-results.tex

Co-authored-by: Anders Malta <74375517+Maltesius@users.noreply.github.com>

Author: ironmand123

report/src/sections/06-results.tex

@@ -43,7 +43,9 @@ \subsection{Shuffle security}\label{subsec:Shuffle-security}
 
 We can see that the bigger the shuffle size $\ell$ is, the less honest shuffles are necessary to make the shuffle secure.
 In Ethereum, each shuffling phase is limited to 8192 shuffles, meaning that the maximum number of honest shuffles that can be used is 8192.
-Therefore, the results of the experiment also finds $T_H=T-\Beta$ being how many of the $T$ shuffles available durring the shuffling phase needing to be honest $T_H$ shuffles where the rest could then be the number of dishonest shuffles $\Beta$.
+Therefore, the results of the experiment also find $T_H=T-\Beta$.
+This is how many of the $T$ shuffles, available during the shuffling phase, are needed to be honest, $T_H$, shuffles.
+The rest could then be the number of dishonest shuffles,~$\beta$.
 We also see that the bigger the shuffle size the narrower the standard deviation gets.
 
 From the results of the experiment with $\alpha=8192$ we can see that number of honest shuffles necessary to make the shuffle secure sharply goes down until a size of $\ell=64$, and then it starts to flatten out.