To: bitcoin-dev@lists.linuxfoundation.org
References: <20151117004218.GB6302@savin.petertodd.org>
From: Chris <ctpacia@gmail.com>
Message-ID: <565BC352.4080001@gmail.com>
Date: Sun, 29 Nov 2015 22:32:34 -0500
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:38.0) Gecko/20100101
	Thunderbird/38.3.0
MIME-Version: 1.0
In-Reply-To: <20151117004218.GB6302@savin.petertodd.org>
Content-Type: multipart/alternative;
	boundary="------------090103000300020906060408"
Subject: Re: [bitcoin-dev] Opt-in Full Replace-By-Fee (Full-RBF)
Precedence: list

This is a multi-part message in MIME format.
--------------090103000300020906060408
Content-Type: text/plain; charset=windows-1252
Content-Transfer-Encoding: 7bit

On 11/16/2015 07:42 PM, Peter Todd via bitcoin-dev wrote:
> Sequence is used for opting in as it is the only "free-form" field
> available for that purpose. Opt-in per output was proposed as well by
> Luke-Jr, however the CTxOut data structure simply doesn't contain any
> extra fields to use for that purpose.
What is wrong with using they same scheme as sighash_single?

If input 0 has nSequence < maxint-1 then output 0 is replaceable.

For fee bumps you would just stick the change in position zero and
reduce the value.

You get FFS functionality without the hassle of addition other inputs.


--------------090103000300020906060408
Content-Type: text/html; charset=windows-1252
Content-Transfer-Encoding: 7bit

<html>
  <head>
    <meta content="text/html; charset=windows-1252"
      http-equiv="Content-Type">
  </head>
  <body bgcolor="#FFFFFF" text="#000000">
    On 11/16/2015 07:42 PM, Peter Todd via bitcoin-dev wrote:<br>
    <blockquote cite="mid:20151117004218.GB6302@savin.petertodd.org"
      type="cite">
      <pre wrap="">Sequence is used for opting in as it is the only "free-form" field
available for that purpose. Opt-in per output was proposed as well by
Luke-Jr, however the CTxOut data structure simply doesn't contain any
extra fields to use for that purpose.</pre>
    </blockquote>
    What is wrong with using they same scheme as sighash_single?<br>
    <br>
    If input 0 has nSequence &lt; maxint-1 then output 0 is replaceable.
    <br>
    <br>
    For fee bumps you would just stick the change in position zero and
    reduce the value.<br>
    <br>
    You get FFS functionality without the hassle of addition other
    inputs. <br>
    <br>
    <span style="color: rgb(34, 54, 69); font-family: 'Open Sans',
      sans-serif; font-size: 34px; font-style: normal; font-variant:
      normal; font-weight: normal; letter-spacing: normal; line-height:
      normal; orphans: auto; text-align: start; text-indent: 0px;
      text-transform: none; white-space: normal; widows: 1;
      word-spacing: 0px; -webkit-text-stroke-width: 0px; display: inline
      !important; float: none;"></span>
  </body>
</html>

--------------090103000300020906060408--