From 8bf25cbb80cd4ebf33aaf6d90df79069a5f18fca Mon Sep 17 00:00:00 2001 From: "loic.miller" Date: Mon, 19 Jun 2023 14:45:13 +0000 Subject: [PATCH] Update on Overleaf. --- ccs-body.tex | 2 -- 1 file changed, 2 deletions(-) diff --git a/ccs-body.tex b/ccs-body.tex index 27c7ce9..a56f42b 100644 --- a/ccs-body.tex +++ b/ccs-body.tex @@ -215,8 +215,6 @@ Any scheme for operating and compressing blockchains requires to design (i) a \e %\label{fig:kiayias_diagram} %\end{figure} - - \subsection{Chain Compression Algorithm} Kiayias et al.'s chain compression algorithm (from~\cite{10.1145/3460120.3484784}, Algorithm 1) is parameterized by a security parameter $m$ and the common prefix parameter $k$. System parameter $m$ represents the number of blocks that a party wishes to receive to feel safe. The algorithm compresses the blockchain except for the $k$ most recent blocks, called \emph{unstable} blocks. The compression works as follows: For the highest level $\ell$ that contains more than $2m$ blocks, keep all the blocks but for every level $\mu$ below $\ell$, only keep the last $2m$ blocks and all the blocks after the $m^\text{th}$ block at the $\mu+1$ level. $\Pi$ is used to represent an instance of NIPoPoW proof.