diff options
author | Matthias Beyer <mail@beyermatthias.de> | 2021-01-02 20:34:58 +0100 |
---|---|---|
committer | Matthias Beyer <mail@beyermatthias.de> | 2021-01-02 20:34:58 +0100 |
commit | 5eec45539b87f77e26addcad8d9f1b05883e3ee4 (patch) | |
tree | 5bec27f86f6173db3eefc93666f213370b41fffe /doc/paper/main.tex | |
parent | 9eeb524ab19c647321ca8914a514d74706579a67 (diff) |
Add graphic how a blockchain could look like
Signed-off-by: Matthias Beyer <mail@beyermatthias.de>
Diffstat (limited to 'doc/paper/main.tex')
-rw-r--r-- | doc/paper/main.tex | 11 |
1 files changed, 11 insertions, 0 deletions
diff --git a/doc/paper/main.tex b/doc/paper/main.tex index 54b6043..bc89d56 100644 --- a/doc/paper/main.tex +++ b/doc/paper/main.tex @@ -126,6 +126,10 @@ Thus, it should only hold the following elements: A block may hold more than one pointer to a parent block to make merges possible on the block-level. +\ref{pic:blockchain} describes a minimal chain of blocks. +Each block, save $A$, points to its predecessor. +$D$ points both to $B$ and $C$, because it merges these blocks, that were both +created with $A$ as their predecessor. \begin{lstlisting}[language=json,caption={Example of a Block},label=jsonblock] { @@ -139,6 +143,13 @@ As shown in \ref{jsonblock}, minimal data is held in the "Block" object. Because of the small size, replication of block objects is cheap and every modern end-user device can easily hold millions of blocks. +\begin{figure}[ht] + \centering + \includegraphics[width=0.45\textwidth]{gen/blockchain.png} + \caption{A chain of blocks} + \label{pic:blockchain} +\end{figure} + If $S_{parents}(b)$ is the size of the list of parents of a block $b$, and $S_{base}$ is the size of a block without any parents, |