1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
Return-Path: <tier.nolan@gmail.com>
Received: from smtp1.linuxfoundation.org (smtp1.linux-foundation.org
[172.17.192.35])
by mail.linuxfoundation.org (Postfix) with ESMTPS id 27C0EAB2
for <bitcoin-dev@lists.linuxfoundation.org>;
Sat, 11 Jul 2015 23:19:16 +0000 (UTC)
X-Greylist: whitelisted by SQLgrey-1.7.6
Received: from mail-qg0-f51.google.com (mail-qg0-f51.google.com
[209.85.192.51])
by smtp1.linuxfoundation.org (Postfix) with ESMTPS id A709FF2
for <bitcoin-dev@lists.linuxfoundation.org>;
Sat, 11 Jul 2015 23:19:15 +0000 (UTC)
Received: by qgep37 with SMTP id p37so50912299qge.1
for <bitcoin-dev@lists.linuxfoundation.org>;
Sat, 11 Jul 2015 16:19:14 -0700 (PDT)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113;
h=mime-version:in-reply-to:references:date:message-id:subject:from:cc
:content-type; bh=lXvJc22L9SEPNS73t7hT2tq+xCgSFbLRauLC8+CCVGM=;
b=gs/RxwRJKrob+DKlqw29pgTs0+KhtN4wAKnHv7ujkv7q5S9DLeAfjFXbiqhSgv4g+B
6EMLWUoNV+3EkCxhR6HUE+exlf+vsRqq3VYy5b+8UGCsQIhuI7eFb5RJ+/w3I71YQ/9k
DP8HIRA0tBzTcvTNvYLE85S2ZnFNcdl4wVAA1IL2VnStLdiuZ2YV6fyhlIVbGYF5Z642
8rQccgpzzpvFoJ8igFPNNct6GexJJCuW2+KgOy1tSB28qSvh6aeIxEF5Ho3H2hmJhKwl
zMnvlxn167DxnpzB3rDx4cCUIhVh51H0ax8etIczZFIU2tMzJXC8lLgi0ubZZl/AKIgo
b0WA==
MIME-Version: 1.0
X-Received: by 10.140.86.137 with SMTP id p9mr19945248qgd.89.1436656754786;
Sat, 11 Jul 2015 16:19:14 -0700 (PDT)
Received: by 10.140.93.162 with HTTP; Sat, 11 Jul 2015 16:19:14 -0700 (PDT)
In-Reply-To: <CAAUFj12JC1e7wY1M-_U_Kh5wQv8V4X0SeGGtONn7m8PcOEhp_Q@mail.gmail.com>
References: <6D3AACE5-D6CD-4785-8A55-F6DF0B94D927@ricmoo.com>
<CAPWm=eWH9rZpwJeK2tTdHH8+BWDU_Vam8oBtG0u49v2yZuYVfw@mail.gmail.com>
<CAE-z3OWMpCW51FjwT8409k_10Uj9Zq=H8AVUo5B6PfYBTQ_Axg@mail.gmail.com>
<201507102110.33706.luke@dashjr.org>
<CAAmoQf1B1nFfS6ZXOkvoJGTaPpbN_NDwOcwCw30MSbRwooSh4Q@mail.gmail.com>
<CAAUFj12JC1e7wY1M-_U_Kh5wQv8V4X0SeGGtONn7m8PcOEhp_Q@mail.gmail.com>
Date: Sun, 12 Jul 2015 00:19:14 +0100
Message-ID: <CAE-z3OVLF5whUL_HoP3i5B5mxB_KztBLJSB1dJ=dQ9+UDg55hg@mail.gmail.com>
From: Tier Nolan <tier.nolan@gmail.com>
Cc: "bitcoin-dev@lists.linuxfoundation.org"
<bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary=001a11c124368883f0051aa1b7b5
X-Spam-Status: No, score=-1.7 required=5.0 tests=BAYES_00,DKIM_SIGNED,
DKIM_VALID,DKIM_VALID_AU,FREEMAIL_FROM,HTML_MESSAGE,MISSING_HEADERS,
RCVD_IN_DNSWL_LOW autolearn=no version=3.3.1
X-Spam-Checker-Version: SpamAssassin 3.3.1 (2010-03-16) on
smtp1.linux-foundation.org
Subject: Re: [bitcoin-dev] Why not Child-Pays-For-Parent?
X-BeenThere: bitcoin-dev@lists.linuxfoundation.org
X-Mailman-Version: 2.1.12
Precedence: list
List-Id: Bitcoin Development Discussion <bitcoin-dev.lists.linuxfoundation.org>
List-Unsubscribe: <https://lists.linuxfoundation.org/mailman/options/bitcoin-dev>,
<mailto:bitcoin-dev-request@lists.linuxfoundation.org?subject=unsubscribe>
List-Archive: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/>
List-Post: <mailto:bitcoin-dev@lists.linuxfoundation.org>
List-Help: <mailto:bitcoin-dev-request@lists.linuxfoundation.org?subject=help>
List-Subscribe: <https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev>,
<mailto:bitcoin-dev-request@lists.linuxfoundation.org?subject=subscribe>
X-List-Received-Date: Sat, 11 Jul 2015 23:19:16 -0000
--001a11c124368883f0051aa1b7b5
Content-Type: text/plain; charset=UTF-8
On Sat, Jul 11, 2015 at 10:30 PM, Dan Bryant <dkbryant@gmail.com> wrote:
> I think a compromise will be somewhere in the middle. I think most people
> would be OK with TXs that don't have enough fees for P2P transfer to stay
> in deadmans land. Most people are stuck in a situation where they payed
> enough to get it into (and keep it in) the pool, but not enough to get it
> out.
>
Agreed. A lot of the functionality could be achieved by a system that
works in most cases. Even if 100 transaction chains aren't supported, 3-5
transaction chains would give a significant fraction of the desired
functionality.
At the moment, a transaction is only added into the memory pool if it meets
the relay threshold and spends transactions that are either in the memory
pool or in a block.
There is an orphan pool that can store up to 100 orphans.
The same could be done for child pays for parent. A node could remember
the last 100 transactions (up to 5000 bytes) that were rejected from the
memory pool due to insufficient relay fees.
This allows nodes to send a chain of transactions in a row. If the child
is sent last, then the parent(s) will be in the unrelayed transaction pool.
--001a11c124368883f0051aa1b7b5
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable
<div dir=3D"ltr"><div class=3D"gmail_extra"><div class=3D"gmail_quote">On S=
at, Jul 11, 2015 at 10:30 PM, Dan Bryant <span dir=3D"ltr"><<a href=3D"m=
ailto:dkbryant@gmail.com" target=3D"_blank">dkbryant@gmail.com</a>></spa=
n> wrote:<br><blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .8ex;b=
order-left:1px #ccc solid;padding-left:1ex"><div dir=3D"ltr"><div>I think a=
compromise will be somewhere in the middle.=C2=A0 I think most
people would be OK with TXs that don't have enough fees for P2P=20
transfer to stay in deadmans land.=C2=A0 Most people are stuck in a situati=
on
where they payed enough to get it into (and keep it in) the pool, but=20
not enough to get it out.<br></div></div></blockquote><div><br></div><div>A=
greed.=C2=A0 A lot of the functionality could be achieved by a system that =
works in most cases.=C2=A0 Even if 100 transaction chains aren't suppor=
ted, 3-5 transaction chains would give a significant fraction of the desire=
d functionality.<br></div><div><br></div><div></div><div>At the moment, a t=
ransaction is only added into the memory pool if it meets the relay thresho=
ld and spends transactions that are either in the memory pool or in a block=
.<br><br></div><div>There is an orphan pool that can store up to 100 orphan=
s.<br><br></div><div>The same could be done for child pays for parent.=C2=
=A0 A node could remember the last 100 transactions (up to 5000 bytes) that=
were rejected from the memory pool due to insufficient relay fees.<br><br>=
</div><div>This allows nodes to send a chain of transactions in a row.=C2=
=A0 If the child is sent last, then the parent(s) will be in the unrelayed =
transaction pool.<br></div></div></div></div>
--001a11c124368883f0051aa1b7b5--
|
