MIME-Version: 1.0
References: <CCA561B6-A2DE-46FD-A2F8-98E0C34A3EEE@zerosync.org>
In-Reply-To: <CCA561B6-A2DE-46FD-A2F8-98E0C34A3EEE@zerosync.org>
From: Lloyd Fournier <lloyd.fourn@gmail.com>
Date: Tue, 10 Oct 2023 12:06:10 +1100
Message-ID: <CAH5Bsr2XaUfYy+gPiSuQaMcxK43CNsR2apKYMTkF1sX3U9Jzbw@mail.gmail.com>
To: Robin Linus <robin@zerosync.org>, 
 Bitcoin Protocol Discussion <bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary="000000000000824c0806075251b4"
Subject: Re: [bitcoin-dev] BitVM: Compute Anything on Bitcoin
Precedence: list

--000000000000824c0806075251b4
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

Hi Robin,

Fascinating result.
Is it possible to give us an example of a protocol that uses BitVM that
couldn't otherwise be built? I'm guessing it's possible to exchange Bitcoin
to someone who can prove they know some input to a binary circuit that
gives some output.

Thanks!

LL

On Tue, 10 Oct 2023 at 01:05, Robin Linus via bitcoin-dev <
bitcoin-dev@lists.linuxfoundation.org> wrote:

> Abstract. BitVM is a computing paradigm to express Turing-complete Bitcoi=
n
> contracts. This requires no changes to the network=E2=80=99s consensus ru=
les.
> Rather than executing computations on Bitcoin, they are merely verified,
> similarly to optimistic rollups. A prover makes a claim that a given
> function evaluates for some particular inputs to some specific output. If
> that claim is false, then the verifier can perform a succinct fraud proof
> and punish the prover. Using this mechanism, any computable function can =
be
> verified on Bitcoin. Committing to a large program in a Taproot address
> requires significant amounts of off-chain computation and communication,
> however the resulting on-chain footprint is minimal. As long as both
> parties collaborate, they can perform arbitrarily complex, stateful
> off-chain computation, without leaving any trace in the chain. On-chain
> execution is required only in case of a dispute.
>
> https://bitvm.org/bitvm.pdf
> _______________________________________________
> bitcoin-dev mailing list
> bitcoin-dev@lists.linuxfoundation.org
> https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev
>

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

<div dir=3D"ltr"><div>Hi Robin,</div><div><br></div><div>Fascinating result=
.<br></div><div>Is it possible to give us an example of a protocol that use=
s BitVM that couldn&#39;t otherwise be built? I&#39;m guessing it&#39;s pos=
sible to exchange Bitcoin to someone who can prove they know some input to =
a binary circuit that gives some output.<br></div><div><br></div><div>Thank=
s!</div><div><br></div><div>LL<br></div></div><br><div class=3D"gmail_quote=
"><div dir=3D"ltr" class=3D"gmail_attr">On Tue, 10 Oct 2023 at 01:05, Robin=
 Linus via bitcoin-dev &lt;<a href=3D"mailto:bitcoin-dev@lists.linuxfoundat=
ion.org">bitcoin-dev@lists.linuxfoundation.org</a>&gt; wrote:<br></div><blo=
ckquote class=3D"gmail_quote" style=3D"margin:0px 0px 0px 0.8ex;border-left=
:1px solid rgb(204,204,204);padding-left:1ex">Abstract. BitVM is a computin=
g paradigm to express Turing-complete Bitcoin contracts. This requires no c=
hanges to the network=E2=80=99s consensus rules. Rather than executing comp=
utations on Bitcoin, they are merely verified, similarly to optimistic roll=
ups. A prover makes a claim that a given function evaluates for some partic=
ular inputs to some specific output. If that claim is false, then the verif=
ier can perform a succinct fraud proof and punish the prover. Using this me=
chanism, any computable function can be verified on Bitcoin. Committing to =
a large program in a Taproot address requires significant amounts of off-ch=
ain computation and communication, however the resulting on-chain footprint=
 is minimal. As long as both parties collaborate, they can perform arbitrar=
ily complex, stateful off-chain computation, without leaving any trace in t=
he chain. On-chain execution is required only in case of a dispute.<br>
<br>
<a href=3D"https://bitvm.org/bitvm.pdf" rel=3D"noreferrer" target=3D"_blank=
">https://bitvm.org/bitvm.pdf</a><br>
_______________________________________________<br>
bitcoin-dev mailing list<br>
<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" target=3D"_blank">=
bitcoin-dev@lists.linuxfoundation.org</a><br>
<a href=3D"https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev" =
rel=3D"noreferrer" target=3D"_blank">https://lists.linuxfoundation.org/mail=
man/listinfo/bitcoin-dev</a><br>
</blockquote></div>

--000000000000824c0806075251b4--