Delivery-date: Sun, 12 May 2024 18:54:24 -0700
Sender: bitcoindev@googlegroups.com
Date: Sun, 12 May 2024 18:51:50 -0700 (PDT)
From: Sergio Demian Lerner <sergio.d.lerner@gmail.com>
To: Bitcoin Development Mailing List <bitcoindev@googlegroups.com>
Message-Id: <5189939b-baaf-4366-92a7-3f3334a742fdn@googlegroups.com>
Subject: [bitcoindev] BitVMX: A Virtual CPU to optimistically execute
 arbitrary programs on Bitcoin
MIME-Version: 1.0
Content-Type: multipart/mixed; 
	boundary="----=_Part_16146_1396980645.1715565110419"
Precedence: list
Mailing-list: list bitcoindev@googlegroups.com; contact bitcoindev+owners@googlegroups.com

------=_Part_16146_1396980645.1715565110419
Content-Type: multipart/alternative; 
	boundary="----=_Part_16147_1489622019.1715565110419"

------=_Part_16147_1489622019.1715565110419
Content-Type: text/plain; charset="UTF-8"

 Hi!
I'd like to share with you a paper we published a few weeks ago, and was 
presented in BTC++. Here is the abstract:

BitVMX is a new design for a virtual CPU to optimistically execute 
arbitrary programs on Bitcoin based on a challenge/response game introduced 
in BitVM. Similar to BitVM1 we create a general-purpose CPU to be verified 
in Bitcoin script. Our design supports common architectures, such as RISC-V 
or MIPS. Our main contribution to the state of the art is a design that 
uses hash chains of program traces, memory mapped registers, and a new 
challenge-response protocol. We present a new message linking protocol as a 
means to allow authenticated communication between the participants. This 
protocol emulates stateful smart contracts by sharing state between 
transactions. This provides a basis for our verification game which uses a 
graph of pre-signed transactions to support challenge-response 
interactions. In case of a dispute, the hash chain of program trace is used 
with selective pre-signed transactions to locate (via n-ary search) and 
then recover the precise nature of errors in the computation. Unlike 
BitVM1, our approach does not require the creation of Merkle trees for CPU 
instructions or memory words. Additionally, it does not rely on signature 
equivocations. These differences help avoid complexities associated with 
BitVM1 and make BitVMX a compelling alternative to BitVM2. Our approach is 
quite flexible, BitVMX can be instantiated to balance transaction cost vs 
round complexity, prover cost vs verifier cost, and precomputations vs 
round complexity. (1)

https://bitvmx.org/files/bitvmx-whitepaper.pdf

Note that since the paper publication we have already improved the protocol 
and halved the number of rounds required, and a new paper presenting these 
improvements will be published soon.
 
With our latest optimizations, verifying a SNARK would require ~19 rounds 
(38 transactions) in the worst case, consuming ~400K weight units (WU) in 
total (spread over all the transactions). This is as a back-of-the-envelope 
estimation, as we're still researching, and the exact resources consumed 
depend on many trade-offs that can be chosen by users.

Also, if we can set an upper bound on the money a party would be willing 
sacrifice (and force the other parties to sacrifice too in equal amount) to 
force the protocol to be extended one more round, then we can further 
reduce both the round complexity or transaction cost (~50%).

regards, Sergio.

(1) Paper authors are Sergio Demian Lerner, Ramon Amela, Shreemoy Mishra, 
Martin Jonas, and Javier Alvarez Cid-Fuentes

-- 
You received this message because you are subscribed to the Google Groups "Bitcoin Development Mailing List" group.
To unsubscribe from this group and stop receiving emails from it, send an email to bitcoindev+unsubscribe@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/bitcoindev/5189939b-baaf-4366-92a7-3f3334a742fdn%40googlegroups.com.

------=_Part_16147_1489622019.1715565110419
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable


=09
=09
		Hi!<br />I'd like to share with you a paper we published a few weeks ago,=
 and was presented in BTC++. Here is the abstract:<div><br />BitVMX is a ne=
w design for a virtual CPU to optimistically execute arbitrary programs on =
Bitcoin based on a challenge/response game introduced in BitVM. Similar to =
BitVM1 we create a general-purpose CPU to be verified in Bitcoin script. Ou=
r design supports common architectures, such as RISC-V or MIPS. Our main co=
ntribution to the state of the art is a design that uses hash chains of pro=
gram traces, memory mapped registers, and a new challenge-response protocol=
. We present a new message linking protocol as a means to allow authenticat=
ed communication between the participants. This protocol emulates stateful =
smart contracts by sharing state between transactions. This provides a basi=
s for our verification game which uses a graph of pre-signed transactions t=
o support challenge-response interactions. In case of a dispute, the hash c=
hain of program trace is used with selective pre-signed transactions to loc=
ate (via n-ary search) and then recover the precise nature of errors in the=
 computation. Unlike BitVM1, our approach does not require the creation of =
Merkle trees for CPU instructions or memory words. Additionally, it does no=
t rely on signature equivocations. These differences help avoid complexitie=
s associated with BitVM1 and make BitVMX a compelling alternative to BitVM2=
. Our approach is quite flexible, BitVMX can be instantiated to balance tra=
nsaction cost vs round complexity, prover cost vs verifier cost, and precom=
putations vs round complexity. (1)<br /><br />https://bitvmx.org/files/bitv=
mx-whitepaper.pdf<br /></div><div><br /></div><div>Note that since the pape=
r publication we have already improved the protocol and halved the number o=
f rounds required, and a new paper presenting these improvements will be pu=
blished soon.</div><div>=C2=A0</div><div>With our latest optimizations, ver=
ifying a SNARK would require ~19 rounds (38 transactions) in the worst case=
, consuming ~400K weight units (WU) in total (spread over all the transacti=
ons). This is as a back-of-the-envelope estimation, as we're still research=
ing, and the exact resources consumed depend on many trade-offs that can be=
 chosen by users.</div><div><br /></div><div>Also, if we can set an upper b=
ound on the money a party would be willing sacrifice (and force the other p=
arties to sacrifice too in equal amount) to force the protocol to be extend=
ed one more round, then we can further reduce both the round complexity or =
transaction cost (~50%).</div><div><br /></div><div>regards, Sergio.</div><=
div><br /></div>(1) Paper authors are Sergio Demian Lerner, Ramon Amela, Sh=
reemoy Mishra, Martin Jonas, and Javier Alvarez Cid-Fuentes<div><br /></div=
>

<p></p>

-- <br />
You received this message because you are subscribed to the Google Groups &=
quot;Bitcoin Development Mailing List&quot; group.<br />
To unsubscribe from this group and stop receiving emails from it, send an e=
mail to <a href=3D"mailto:bitcoindev+unsubscribe@googlegroups.com">bitcoind=
ev+unsubscribe@googlegroups.com</a>.<br />
To view this discussion on the web visit <a href=3D"https://groups.google.c=
om/d/msgid/bitcoindev/5189939b-baaf-4366-92a7-3f3334a742fdn%40googlegroups.=
com?utm_medium=3Demail&utm_source=3Dfooter">https://groups.google.com/d/msg=
id/bitcoindev/5189939b-baaf-4366-92a7-3f3334a742fdn%40googlegroups.com</a>.=
<br />

------=_Part_16147_1489622019.1715565110419--

------=_Part_16146_1396980645.1715565110419--