MIME-Version: 1.0
Sender: marek@palatinus.cz
In-Reply-To: <CAAS2fgSKBS9zCQqp+hJUF2Ro8LNw4s0=J08M=76sOJmNfpLptQ@mail.gmail.com>
References: <CAJna-HjwMRff_+7BvcR2YME9f2yUQPvfKOGZ1qq9d0nOGqORkg@mail.gmail.com>
	<54C267A1.8090208@gmail.com>
	<CAAS2fgQSAj=YHhtvy=MY9GvbEZNxtLUwzfrdPnSQBUKZYdj4oA@mail.gmail.com>
	<CAJna-HgL_-PTfmS-kA00DfZiZ8uPFqQTytihY6o8De5KVvDThw@mail.gmail.com>
	<CAAS2fgSKBS9zCQqp+hJUF2Ro8LNw4s0=J08M=76sOJmNfpLptQ@mail.gmail.com>
From: slush <slush@centrum.cz>
Date: Fri, 23 Jan 2015 18:40:54 +0100
Message-ID: <CAJna-Hi1PaJ-Xxr+quubtOVrhv-KPxkbC=jhNU5cm43GOnb67A@mail.gmail.com>
To: Gregory Maxwell <gmaxwell@gmail.com>
Content-Type: multipart/alternative; boundary=089e0122acca2ce45a050d554c6b
Cc: Bitcoin Development <bitcoin-development@lists.sourceforge.net>
Subject: Re: [Bitcoin-development] SIGHASH_WITHINPUTVALUE
Precedence: list

--089e0122acca2ce45a050d554c6b
Content-Type: text/plain; charset=ISO-8859-1

Yes, the step you're missing is "and build the table". Dynamic memory
allocation is something you want to avoid, as well as any artifical
restrictions to number of inputs or outputs. Current solution is slow, but
there's really no limitation on tx size.

Plus there're significant restrictions to memory in embedded world.
Actually TREZOR uses pretty powerful (and expensive) MCU just because it
needs to do such validations and calculate such hashes. With
SIGHASH_WITHINPUTVALUE or similar we may cut hardware cost significantly.

Marek

On Fri, Jan 23, 2015 at 5:52 PM, Gregory Maxwell <gmaxwell@gmail.com> wrote:

> I'm not sure where the ^2 is coming from.  So what I'd understand that
> you'd do is stream in the input txid:vouts which you spend, then you'd
> stream the actual inputs which would just be hashed and value
> extracted (but no other verification), and you'd build a table of
> txid:vout->value, then the actual transaction to be signed.
>
> This should have O(inputs) hashing and communications overhead. Is
> there a step I'm missing?
>

--089e0122acca2ce45a050d554c6b
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Yes, the step you&#39;re missing is &quot;and build the ta=
ble&quot;. Dynamic memory allocation is something you want to avoid, as wel=
l as any artifical restrictions to number of inputs or outputs. Current sol=
ution is slow, but there&#39;s really no limitation on tx size.<div><br></d=
iv><div>Plus there&#39;re significant restrictions to memory in embedded wo=
rld. Actually TREZOR uses pretty powerful (and expensive) MCU just because =
it needs to do such validations and calculate such hashes. With SIGHASH_WIT=
HINPUTVALUE or similar we may cut hardware cost significantly.<br></div><di=
v><br></div><div>Marek</div><div><div class=3D"gmail_extra"><br><div class=
=3D"gmail_quote">On Fri, Jan 23, 2015 at 5:52 PM, Gregory Maxwell <span dir=
=3D"ltr">&lt;<a href=3D"mailto:gmaxwell@gmail.com" target=3D"_blank">gmaxwe=
ll@gmail.com</a>&gt;</span> wrote:<br><blockquote class=3D"gmail_quote" sty=
le=3D"margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">I&#39;=
m not sure where the ^2 is coming from.=A0 So what I&#39;d understand that<=
br>
you&#39;d do is stream in the input txid:vouts which you spend, then you=
9;d<br>
stream the actual inputs which would just be hashed and value<br>
extracted (but no other verification), and you&#39;d build a table of<br>
txid:vout-&gt;value, then the actual transaction to be signed.<br>
<br>
This should have O(inputs) hashing and communications overhead. Is<br>
there a step I&#39;m missing?<br>
</blockquote></div><br></div></div></div>

--089e0122acca2ce45a050d554c6b--