From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from smtp1.linuxfoundation.org (smtp1.linux-foundation.org [172.17.192.35]) by mail.linuxfoundation.org (Postfix) with ESMTPS id 16B49C07 for ; Mon, 30 Oct 2017 15:31:26 +0000 (UTC) X-Greylist: whitelisted by SQLgrey-1.7.6 Received: from mail-pg0-f53.google.com (mail-pg0-f53.google.com [74.125.83.53]) by smtp1.linuxfoundation.org (Postfix) with ESMTPS id 000B616A for ; Mon, 30 Oct 2017 15:31:24 +0000 (UTC) Received: by mail-pg0-f53.google.com with SMTP id a192so11902159pge.9 for ; Mon, 30 Oct 2017 08:31:24 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=friedenbach-org.20150623.gappssmtp.com; s=20150623; h=from:content-transfer-encoding:mime-version:date:subject:message-id :references:in-reply-to:to; bh=CXnHB1J4MnYaPoEG45b/BI2cI6UuqKpeWHYvhaiaIac=; b=nvxVkPfMhooo2Yk+mV29kz4UhqZnO2oFhNmDlijxNH4/SbPiPBhrL/a3Q9xBIIPzXJ fiD/i38VExdPGzlqDhTJMYp18fV2Op8LEYqEqOuX3898qttWaYR9KYhLx1l+YhvvmKGH DwNvZ0qvm8wyIkp1bqYjIoHJbjn1WZkAB1GJauIF85+RsgrqTxOryAhWHmwJOHV88BGQ x6Ul+dtwX2+Ub6r7EWTvcZYLAQog+DMM4pq7aaWBf8603P5zsyK6CoesAcwPwHNQeJ9K mR2CDxGp03XEWNkanzOGgOOiUCi84DFJuVKJChtGjXt1yJuiM3Fpnljr93d+0o9qgUAg tT3g== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:from:content-transfer-encoding:mime-version:date :subject:message-id:references:in-reply-to:to; bh=CXnHB1J4MnYaPoEG45b/BI2cI6UuqKpeWHYvhaiaIac=; b=oNzBHvazI4+2csNz/8zKAQR2mqgMsVrUUE8rZpsElERtkfLWdqdDQ56LV5a7MCDKTK 8MKyWOm7JDebRYlFdc4H16vgF2lj97vGyZTyckbbNMviwf5RVtPAcF4kVMnZKCh85BRd JMxKYrTzqIFDoxBqzASIyRgXaBZp8oVDTdqGi9EWN/n3a0poHyeYzkCDtzMFzY/QMF8K agAeSAE7ARUYE5QcJVrFcyVN1OX/Tx6k49LOFnPEJoqcbAaMU8Ie6pkWt4hwiqHX5Rpb XyYJ51akcNL5WkQsu48ygjU7iIG2cA5eA1ikur03EY68owDeIHgiv/plmcpf++yJgjlq VXsw== X-Gm-Message-State: AMCzsaUZDKxN7DX0XH/pU1+dLFNZr4S2FitRNu/M96MMeIORcO7BfKS6 yT6816Djihlh5TxnpftwOjPWmZhZTdg= X-Google-Smtp-Source: ABhQp+QnZ2a9tG39scwJA/7+0/PVYMC95FSGPfX+k3tZgtNE47/8Hbxe63yirrD0eonBZ90+AUSD1Q== X-Received: by 10.98.89.208 with SMTP id k77mr9356288pfj.164.1509377484407; Mon, 30 Oct 2017 08:31:24 -0700 (PDT) Received: from ?IPv6:2607:fb90:a45b:cc2c:3426:1dfc:f5e3:2061? ([2607:fb90:a45b:cc2c:3426:1dfc:f5e3:2061]) by smtp.gmail.com with ESMTPSA id e24sm33037389pfl.43.2017.10.30.08.31.23 (version=TLS1_2 cipher=ECDHE-RSA-AES128-GCM-SHA256 bits=128/128); Mon, 30 Oct 2017 08:31:23 -0700 (PDT) From: Mark Friedenbach Content-Type: multipart/alternative; boundary=Apple-Mail-12649DF9-94A7-4B6A-B657-BB5B3F8D6FF0 Content-Transfer-Encoding: 7bit Mime-Version: 1.0 (1.0) Date: Mon, 30 Oct 2017 08:31:22 -0700 Message-Id: References: In-Reply-To: To: Russell O'Connor , Bitcoin Protocol Discussion X-Mailer: iPhone Mail (15A432) X-Spam-Status: No, score=0.0 required=5.0 tests=DKIM_SIGNED,DKIM_VALID, HTML_MESSAGE,MIME_QP_LONG_LINE,RCVD_IN_DNSWL_NONE autolearn=disabled version=3.3.1 X-Spam-Checker-Version: SpamAssassin 3.3.1 (2010-03-16) on smtp1.linux-foundation.org Subject: Re: [bitcoin-dev] Simplicity: An alternative to Script X-BeenThere: bitcoin-dev@lists.linuxfoundation.org X-Mailman-Version: 2.1.12 Precedence: list List-Id: Bitcoin Protocol Discussion List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Mon, 30 Oct 2017 15:31:26 -0000 --Apple-Mail-12649DF9-94A7-4B6A-B657-BB5B3F8D6FF0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: quoted-printable So enthused that this is public now! Great work.=20 Sent from my iPhone > On Oct 30, 2017, at 8:22 AM, Russell O'Connor via bitcoin-dev wrote: >=20 > I've been working on the design and implementation of an alternative to Bi= tcoin Script, which I call Simplicity. Today, I am presenting my design at t= he PLAS 2017 Workshop on Programming Languages and Analysis for Security. Y= ou find a copy of my Simplicity paper at https://blockstream.com/simplicity.= pdf >=20 > Simplicity is a low-level, typed, functional, native MAST language where p= rograms are built from basic combinators. Like Bitcoin Script, Simplicity i= s designed to operate at the consensus layer. While one can write Simplicit= y by hand, it is expected to be the target of one, or multiple, front-end la= nguages. >=20 > Simplicity comes with formal denotational semantics (i.e. semantics of wha= t programs compute) and formal operational semantics (i.e. semantics of how p= rograms compute). These are both formalized in the Coq proof assistant and p= roven equivalent. >=20 > Formal denotational semantics are of limited value unless one can use them= in practice to reason about programs. I've used Simplicity's formal semanti= cs to prove correct an implementation of the SHA-256 compression function wr= itten in Simplicity. I have also implemented a variant of ECDSA signature v= erification in Simplicity, and plan to formally validate its correctness alo= ng with the associated elliptic curve operations. >=20 > Simplicity comes with easy to compute static analyses that can compute bou= nds on the space and time resources needed for evaluation. This is importa= nt for both node operators, so that the costs are knows before evaluation, a= nd for designing Simplicity programs, so that smart-contract participants c= an know the costs of their contract before committing to it. >=20 > As a native MAST language, unused branches of Simplicity programs are prun= ed at redemption time. This enhances privacy, reduces the block weight used= , and can reduce space and time resource costs needed for evaluation. >=20 > To make Simplicity practical, jets replace common Simplicity expressions (= identified by their MAST root) and directly implement them with C code. I a= nticipate developing a broad set of useful jets covering arithmetic operatio= ns, elliptic curve operations, and cryptographic operations including hashin= g and digital signature validation. >=20 > The paper I am presenting at PLAS describes only the foundation of the Sim= plicity language. The final design includes extensions not covered in the p= aper, including >=20 > - full convent support, allowing access to all transaction data. > - support for signature aggregation. > - support for delegation. >=20 > Simplicity is still in a research and development phase. I'm working to p= roduce a bare-bones SDK that will include=20 >=20 > - the formal semantics and correctness proofs in Coq > - a Haskell implementation for constructing Simplicity programs > - and a C interpreter for Simplicity. >=20 > After an SDK is complete the next step will be making Simplicity available= in the Elements project so that anyone can start experimenting with Simplic= ity in sidechains. Only after extensive vetting would it be suitable to cons= ider Simplicity for inclusion in Bitcoin. >=20 > Simplicity has a long ways to go still, and this work is not intended to d= elay consideration of the various Merkelized Script proposals that are curre= ntly ongoing. > _______________________________________________ > bitcoin-dev mailing list > bitcoin-dev@lists.linuxfoundation.org > https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev --Apple-Mail-12649DF9-94A7-4B6A-B657-BB5B3F8D6FF0 Content-Type: text/html; charset=utf-8 Content-Transfer-Encoding: 7bit So enthused that this is public now! Great work. 

Sent from my iPhone

On Oct 30, 2017, at 8:22 AM, Russell O'Connor via bitcoin-dev <bitcoin-dev@lists.linuxfoundation.org> wrote:

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 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 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.
_______________________________________________
bitcoin-dev mailing list
bitcoin-dev@lists.linuxfoundation.org
https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev
--Apple-Mail-12649DF9-94A7-4B6A-B657-BB5B3F8D6FF0--