MIME-Version: 1.0
From: "Rune K. Svendsen" <runesvend@gmail.com>
Date: Sat, 17 Sep 2016 22:45:17 +0200
Message-ID: <CAH2=CKzsHROCXQHRS25i5O8XUPkbwFMDAFC_CO9MD6RuJajA4g@mail.gmail.com>
To: Bitcoin <bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary=001a113a31624877e0053cba2948
Subject: [bitcoin-dev] Simple tx ID malleability fix,
	opcode proposal: OP_TXHASHVERIFY
Precedence: list

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

I would really like to be able to create transactions that are immune to
transaction ID malleability now, so I have been thinking of the simplest
solution possible, in order to get a BIP through without too much trouble.

An opcode we could call OP_TXHASHVERIFY could be introduced. It would be
defined to work only if added to a scriptSig as the very first operation,
and would abort if the hash of the transaction **with all OP_TXHASHVERIFY
operations (including stack push) removed** does not match what has been
pushed on the stack.

So, in order to produce a transaction with one or more inputs protected
against tx ID malleability, one would:

1. Calculate tx ID of the tx: TX_HASH
2. For each input you wish to protect, add "0x32 $TX_HASH OP_TXHASHVERIFY"
to the beginning of the scriptSig

When evaluating OP_TXHASHVERIFY, we make a copy of the tx in question, and
remove the "0x32 <32 bytes> OP_TXHASHVERIFY" sequence from the beginning of
all scriptSigs (if present), and abort if the tx copy hash does not match
the top stack item.

This is a very simple solution that only adds 34 bytes per input, and when
something better becomes available (eg. Segwit), we will stop using this.
But in the meantime it's very valuable to be able to not worry about tx ID
malleability.

Please let me know what you think.


            /Rune

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

<div dir=3D"ltr">I would really like to be able to create transactions that=
 are immune to transaction ID malleability now, so I have been thinking of =
the simplest solution possible, in order to get a BIP through without too m=
uch trouble.<div><br></div><div>An opcode we could call OP_TXHASHVERIFY cou=
ld be introduced. It would be defined to work only if added to a scriptSig =
as the very first operation, and would abort if the hash of the transaction=
 **with all OP_TXHASHVERIFY operations (including stack push) removed** doe=
s not match what has been pushed on the stack.</div><div><br></div><div>So,=
 in order to produce a transaction with one or more inputs protected agains=
t tx ID malleability, one would:</div><div><br></div><div>1. Calculate tx I=
D of the tx: TX_HASH</div><div>2. For each input you wish to protect, add &=
quot;0x32 $TX_HASH OP_TXHASHVERIFY&quot; to the beginning of the scriptSig<=
/div><div><br></div><div>When evaluating OP_TXHASHVERIFY, we make a copy of=
 the tx in question, and remove the &quot;0x32 &lt;32 bytes&gt; OP_TXHASHVE=
RIFY&quot; sequence from the beginning of all scriptSigs (if present), and =
abort if the tx copy hash does not match the top stack item.</div><div><br>=
</div><div>This is a very simple solution that only adds 34 bytes per input=
, and when something better becomes available (eg. Segwit), we will stop us=
ing this. But in the meantime it&#39;s very valuable to be able to not worr=
y about tx ID malleability.</div><div><br></div><div>Please let me know wha=
t you think.</div><div><br></div><div><br></div><div><br></div><div>=C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 /Rune</div></div>

--001a113a31624877e0053cba2948--