\cite{BGP_Lamport_Shostak_Pease_1982}

papers/CasperTFG/CasperTFG.tex

@@ -85,7 +85,7 @@ \subsection{Comparing Traditional Consensus to Blockchain Consensus}
 
 Traditional consensus protocol research has focused on producing protocols that are asynchronously safe (i.e.\ blocks won't be reverted due to arbitrary timing of future events) and live in asynchrony (or partial synchrony) (i.e.\ nodes eventually decide on new blocks) \cite{Fischer_Lynch_Paterson_FLP_Impossibility_1985}. On the other hand, the Bitcoin blockchain is not safe in an asynchonous network but is safe and live (for unknown block-depth or ``confirmation count'') in a ``partially synchronous network''.
 
-Traditional Byzantine fault tolerant consensus protocols have precisely stated Byzantine fault tolerance numbers (often they can tolerate less than a third of Byzantine faults, or up to $t$ faults when there are $3t + 1$ nodes)[CITE]. On the other hand, it is less clear exactly how many faults (measured as a proportion of hashrate) the Bitcoin blockchain protocol can tolerate.
+Traditional Byzantine fault tolerant consensus protocols have precisely stated Byzantine fault tolerance numbers (often they can tolerate less than a third of Byzantine faults, or up to $t$ faults when there are $3t + 1$ nodes).\cite{BGP_Lamport_Shostak_Pease_1982} On the other hand, it is less clear exactly how many faults (measured as a proportion of hashrate) the Bitcoin blockchain protocol can tolerate.
 
 \subsection{Overview of the Work Presented}
 

papers/CasperTFG/ethereum.bib

@@ -1,3 +1,28 @@
+@article{BGP_Lamport_Shostak_Pease_1982,
+  title = {{The Byzantine Generals Problem}},
+  author = "Leslie Lamport and Robert Shostak and Marshall Pease",
+  url = "http://research.microsoft.com/en-us/um/people/lamport/pubs/byz.pdf",
+  note = "Archived from the original, now dead link: \url{https://web.archive.org/web/20170207104645/http://research.microsoft.com/en-us/um/people/lamport/pubs/byz.pdf} on 7 February 2017}",
+  year = "1982",
+  month = "July",
+  journal = "ACM Transactions on Programming Languages and Systems",
+  volume = "4",
+  number = "3",
+  pages = "382–401",
+}
+
+@article{Feldman_1997,
+  title = {{An optimal probabilistic protocol for synchronous Byzantine agreement}},
+  author = "Feldman, P. and Micali, S",
+  url = "http://people.csail.mit.edu/silvio/Selected%20Scientific%20Papers/Distributed%20Computation/An%20Optimal%20Probabilistic%20Algorithm%20for%20Byzantine%20Agreement.pdf",
+  year = "1997",
+  journal = {{SIAM J. Comput.}},
+  volume = "26",
+  number = "4",
+  doi = "10.1137/s0097539790187084",
+  pages = 873–933,
+}
+
 @misc{orphanBitcoin,
   title = {{Orphan Blocks}},
   url = "https://bitcoin.org/en/developer-guide#orphan-blocks",