status-im/research
2
0
Fork 0
mirror of https://github.com/status-im/research.git synced 2025-02-28 14:40:43 +00:00
Code Issues Projects Releases Wiki Activity

added reference to GHOST and fixed author name (oops)

Browse Source
This commit is contained in:
Vlad Zamfir 2017-11-02 15:33:35 -03:00
parent 0cac0bf1f9
commit d1301c6975
3 changed files with 10 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

BIN
papers/CasperTFG/CasperTFG.pdf
View File

Binary file not shown.

4
papers/CasperTFG/CasperTFG.tex
View File

@ -44,7 +44,7 @@
\mathrm{1}_{#1} \mathrm{1}_{#1}
} }
\AtBeginEnvironment{quote}{\singlespacing\small} \AtBeginEnvironment{quote}{\small}
\setlength{\parskip}{1em} \setlength{\parskip}{1em}
\setlength{\parindent}{2em} \setlength{\parindent}{2em}
@ -62,7 +62,7 @@
\begin{abstract} \begin{abstract}
We present a specification and limited experimental observations of a blockchain-based consensus protocol, ``Casper the Friendly Ghost.'' We present a specification and limited experimental observations of a blockchain-based consensus protocol, ``Casper the Friendly Ghost.''
The protocol uses an adaptation of Y.\ Jompolovsky and A.\ Zohar's Greedy Heaviest Observed Sub-tree (GHOST) as a ``fork-choice rule.'' It is able to finalize/decide on blocks with asynchronous and Byzantine fault tolerant consensus safety. It allows blocks to be finalized while the network operates with the network overhead of the Bitcoin blockchain, with each node receiving $\mathcal{O}(1)$ messages/block. This is in contrast to the $\mathcal{O}(N)$ traditionally required for Byzantine fault tolerant state machine replication. The protocol uses an adaptation of Y.\ Sompolinsky and A.\ Zohar's Greedy Heaviest Observed Sub-tree (GHOST) \cite{GHOST} as a ``fork-choice rule.'' It is able to finalize/decide on blocks with asynchronous and Byzantine fault tolerant consensus safety. It allows blocks to be finalized while the network operates with the network overhead of the Bitcoin blockchain, with each node receiving $\mathcal{O}(1)$ messages/block. This is in contrast to the $\mathcal{O}(N)$ traditionally required for Byzantine fault tolerant state machine replication.
For pedagogical reasons, we first specify a binary consensus protocol (which decides on a bit, $0$ or $1$). This binary consensus protocol satisfies the same consensus safety proof as the blockchain consensus protocol and is therefore very similar to the blockchain consensus protocol. For pedagogical reasons, we first specify a binary consensus protocol (which decides on a bit, $0$ or $1$). This binary consensus protocol satisfies the same consensus safety proof as the blockchain consensus protocol and is therefore very similar to the blockchain consensus protocol.

8
papers/CasperTFG/ethereum.bib
View File

@ -1,3 +1,11 @@
@MISC{GHOST,
TITLE = {Secure High-Rate Transaction Processing in Bitcoin},
author = {Yonatan Sompolinsky and Aviv Zohar},
URL = {https://eprint.iacr.org/2013/881.pdf},
YEAR = {2013},
Month = {12}
}
@MISC{nakamoto, @MISC{nakamoto,
TITLE = {Bitcoin: A Peer-to-Peer Electronic Cash Systems}, TITLE = {Bitcoin: A Peer-to-Peer Electronic Cash Systems},
author = {Satoshi Nakamoto}, author = {Satoshi Nakamoto},