MIME-Version: 1.0
From: "Russell O'Connor" <roconnor@blockstream.io>
Date: Mon, 30 Oct 2017 11:22:20 -0400
Message-ID: <CAMZUoK=VNRMda8oRCtxniE6-vLwG-b=je2Hx+sD9sCzS--v9kQ@mail.gmail.com>
To: Bitcoin Protocol Discussion <bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary="001a11425b169e5b5c055cc535f0"
Subject: [bitcoin-dev] Simplicity: An alternative to Script
Precedence: list

--001a11425b169e5b5c055cc535f0
Content-Type: text/plain; charset="UTF-8"

I've been working on the design and implementation of an alternative to
Bitcoin Script, which I call Simplicity.  Today, I am presenting my design
at the PLAS 2017 Workshop <http://plas2017.cse.buffalo.edu/> on Programming
Languages and Analysis for Security.  You find a copy of my Simplicity
paper at https://blockstream.com/simplicity.pdf

Simplicity is a low-level, typed, functional, native MAST language where
programs are built from basic combinators.  Like Bitcoin Script, Simplicity
is designed to operate at the consensus layer.  While one can write
Simplicity by hand, it is expected to be the target of one, or multiple,
front-end languages.

Simplicity comes with formal denotational semantics (i.e. semantics of what
programs compute) and formal operational semantics (i.e. semantics of how
programs compute). These are both formalized in the Coq proof assistant and
proven equivalent.

Formal denotational semantics are of limited value unless one can use them
in practice to reason about programs. I've used Simplicity's formal
semantics to prove correct an implementation of the SHA-256 compression
function written in Simplicity.  I have also implemented a variant of ECDSA
signature verification in Simplicity, and plan to formally validate its
correctness along with the associated elliptic curve operations.

Simplicity comes with easy to compute static analyses that can compute
bounds on the space and time resources needed for evaluation.  This is
important for both node operators, so that the costs are knows before
evaluation, and for designing Simplicity programs, so that smart-contract
participants can know the costs of their contract before committing to it.

As a native MAST language, unused branches of Simplicity programs are
pruned at redemption time.  This enhances privacy, reduces the block weight
used, and can reduce space and time resource costs needed for evaluation.

To make Simplicity practical, jets replace common Simplicity expressions
(identified by their MAST root) and directly implement them with C code.  I
anticipate developing a broad set of useful jets covering arithmetic
operations, elliptic curve operations, and cryptographic operations
including hashing and digital signature validation.

The paper I am presenting at PLAS describes only the foundation of the
Simplicity language.  The final design includes extensions not covered in
the paper, including

- full convent support, allowing access to all transaction data.
- support for signature aggregation.
- support for delegation.

Simplicity is still in a research and development phase.  I'm working to
produce a bare-bones SDK that will include

- the formal semantics and correctness proofs in Coq
- a Haskell implementation for constructing Simplicity programs
- and a C interpreter for Simplicity.

After an SDK is complete the next step will be making Simplicity available
in the Elements project <https://elementsproject.org/> so that anyone can
start experimenting with Simplicity in sidechains. Only after extensive
vetting would it be suitable to consider Simplicity for inclusion in
Bitcoin.

Simplicity has a long ways to go still, and this work is not intended to
delay consideration of the various Merkelized Script proposals that are
currently ongoing.

--001a11425b169e5b5c055cc535f0
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div>I&#39;ve
 been working on the design and implementation of an alternative to=20
Bitcoin Script, which I call Simplicity.=C2=A0 Today, I am presenting my=20
design at the <a href=3D"http://plas2017.cse.buffalo.edu/" target=3D"_blank=
">PLAS 2017 Workshop</a> on Programming Languages and Analysis for Security=
.=C2=A0 You find a copy of my Simplicity paper at <a href=3D"https://blocks=
tream.com/simplicity.pdf" target=3D"_blank">https://blockstream.com/<wbr>si=
mplicity.pdf</a><br></div><div><br></div>Simplicity
 is a low-level, typed, functional, native MAST language where programs=20
are built from basic combinators.=C2=A0 Like Bitcoin Script, Simplicity is=
=20
designed to operate at the consensus layer.=C2=A0 While one can write=20
Simplicity by hand, it is expected to be the target of one, or multiple,
 front-end languages.<br><div><br></div><div>Simplicity comes with
 formal denotational semantics (i.e. semantics of what programs compute)
 and formal operational semantics (i.e. semantics of how programs=20
compute). These are both formalized in the Coq proof assistant and=20
proven equivalent.<br><br></div>Formal denotational semantics are of=20
limited value unless one can use them in practice to reason about=20
programs. I&#39;ve used Simplicity&#39;s formal semantics to prove correct =
an=20
implementation of the SHA-256 compression function written in=20
Simplicity.=C2=A0 I have also implemented a variant of ECDSA signature=20
verification in Simplicity, and plan to formally validate its=20
correctness along with the associated elliptic curve operations.<br><div><b=
r>Simplicity
 comes with easy to compute static analyses that can compute bounds on=20
the space and time resources needed for evaluation.=C2=A0 This is important=
=20
for both node operators, so that the costs are knows before evaluation,=20
and for designing Simplicity programs, so that smart-contract=20
participants can know the costs of their contract before committing to=20
it.</div><div><br></div><div>As a native MAST language, unused branches=20
of Simplicity programs are pruned at redemption time.=C2=A0 This enhances=
=20
privacy, reduces the block weight used, and can reduce space and time=20
resource costs needed for evaluation.</div><div><br></div><div>To make=20
Simplicity practical, jets replace common Simplicity expressions=20
(identified by their MAST root) and directly implement them with C=20
code.=C2=A0 I anticipate developing a broad set of useful jets covering=20
arithmetic operations, elliptic curve operations, and cryptographic=20
operations including hashing and digital signature validation.<br></div><di=
v><br></div><div>The
 paper I am presenting at PLAS describes only the foundation of the=20
Simplicity language.=C2=A0 The final design includes extensions not covered=
=20
in the paper, including</div><div><br></div><div>- full convent support, al=
lowing access to all transaction data.</div><div>- support for signature ag=
gregation.</div><div>- support for delegation.</div><div><br></div><div>Sim=
plicity is still in a research and development phase.=C2=A0 I&#39;m working=
 to produce a bare-bones SDK that will include <br></div><div><br></div><di=
v>- the formal semantics and correctness proofs in Coq</div><div>- a Haskel=
l implementation for constructing Simplicity programs</div><div>- and a C i=
nterpreter for Simplicity.<br></div><div><br></div><div>After an SDK is com=
plete the next step will be making Simplicity available in the <a href=3D"h=
ttps://elementsproject.org/" target=3D"_blank">Elements project</a>
 so that anyone can start experimenting with Simplicity in sidechains.=20
Only after extensive vetting would it be suitable to consider Simplicity
 for inclusion in Bitcoin.</div><div><br></div>Simplicity has a=20
long ways to go still, and this work is not intended to delay=20
consideration of the various Merkelized Script proposals that are=20
currently ongoing.</div>

--001a11425b169e5b5c055cc535f0--