Update on Overleaf.

ccs-body.tex

@@ -543,7 +543,6 @@ For the common prefix to hold, we need $k \geq \frac{\theta \gamma m}{4 \tau}$.
     % Page 2 Garay variable difficulty
     \item $\gamma$: by definition of $(\gamma, s)-respecting$, we have $\gamma \geq \frac{max_{r\in S}n_r}{min_{r \in S}n_r}$ with $n_r = \frac{diff(S)f 2^\kappa}{n_0 m T_0}$
     % ñ definition page 172 Zindros thesis
-    % testeok
 \end{itemize}
 
 \section{Analysis}\label{sec:analysis}

ccs-template.tex

@@ -54,6 +54,7 @@
     This paper addresses the lack of scalability in current blockchain technology and its hindrance to widespread adoption.
     Blockchain data is categorized into application data and consensus data, with consensus data growing unboundedly at a constant linear rate in time.
     Recently, a protocol to reduce storage and communication complexity of blockchains to $O(polylog(n))$ was proposed, but its security was only proven in a static context.
+    
     This paper focuses on modifying the protocol to fit a dynamic environment, with participants joining or leaving the network, and proving the upkeep of security properties in this context.
     The contributions of this paper include a study of the protocol in the dynamic context, its modification, and proof of properties in the dynamic context.
 \end{abstract}