From 1703977b8697e1713859abf91005a0c09b144320 Mon Sep 17 00:00:00 2001
From: Thibaut Horel <thibaut.horel@gmail.com>
Date: Wed, 11 May 2016 22:11:21 -0400
Subject: Adding the abstract

---
 report/main.tex | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)

(limited to 'report/main.tex')

diff --git a/report/main.tex b/report/main.tex
index 8b5d756..e7e5f12 100644
--- a/report/main.tex
+++ b/report/main.tex
@@ -38,6 +38,22 @@
 \begin{document}
 \maketitle
 
+\begin{abstract}
+Proofs of Space is a recently proposed alternative to Proofs of Work in which
+    the access to a shared resource is restricted by forcing the service
+    requester to dedicate some amount of disk space.
+
+    At the core of Proofs of Space is a cryptographic data structure known as
+    Merkle trees and a challenge/answer interactive protocol using this tree.
+    The question is then to understand the trade-offs in designing the data
+    layout and data access methods of a Proof of Space system to make the
+    protocol as efficient as possible.
+
+    We propose several strategies, both for the Merkle tree construction and
+    for the proof retrieval phase and compare their relative advantages from
+    the systems perspective. 
+\end{abstract}
+
 \section{Introduction}
 
 \paragraph{Proofs of Work.} Proofs of Work (PoW) were introduced in the early
-- 
cgit v1.2.3-70-g09d2

