summaryrefslogtreecommitdiff
path: root/04/df5bd3f694f8c96be4277a31b8634a1eb81803
blob: f8bccea02fc7cd973b330e47b4e1e7ab08373ba4 (plain)
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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
Return-Path: <akiva.lichtner@gmail.com>
Received: from smtp1.linuxfoundation.org (smtp1.linux-foundation.org
	[172.17.192.35])
	by mail.linuxfoundation.org (Postfix) with ESMTPS id F1FECCE7
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Tue,  8 Dec 2015 21:23:14 +0000 (UTC)
X-Greylist: whitelisted by SQLgrey-1.7.6
Received: from mail-qg0-f41.google.com (mail-qg0-f41.google.com
	[209.85.192.41])
	by smtp1.linuxfoundation.org (Postfix) with ESMTPS id 3C6F218F
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Tue,  8 Dec 2015 21:23:14 +0000 (UTC)
Received: by qgec40 with SMTP id c40so37636101qge.2
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Tue, 08 Dec 2015 13:23:13 -0800 (PST)
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:to
	:cc:content-type;
	bh=f5mjz8zWkd26amlOQGrov5cXkM2UlHodl3Ayl9Ooy4A=;
	b=0r8GvwsklWnw/SmEvXrkUWNEwj4/vuYOqpmcZEt+GbdV0BYP4AMTafvl7ivKuA1tDz
	PUTKlwzaTJWaPSA0rRFJx1iy/MmleEhuvT1JlMXBap8pbUiz9eItQVPm8x48hTGfn/lg
	qJ7tsNt9AA1N8vn8jL34nOeETUY5a/EtnZsl9FdRRlNv5jxBuoiBatNT54keztj99QWG
	rCVfOosrT8qc3BgtCjnevabAvr+ibkiKE7jg8keUlQ8WmopSu1lKryn2radC7SfkkQdE
	e5YlT6wq8JBjTx0OVHmYREVmdY0Bj2FuvB6ATR079jyRouyXvhFvU6CELZ+/FU3L9+WS
	00LA==
MIME-Version: 1.0
X-Received: by 10.55.22.29 with SMTP id g29mr2566192qkh.100.1449609792566;
	Tue, 08 Dec 2015 13:23:12 -0800 (PST)
Received: by 10.140.101.112 with HTTP; Tue, 8 Dec 2015 13:23:12 -0800 (PST)
In-Reply-To: <56674280.3010003@gmail.com>
References: <CABCnA7Wqz76m8qo5BYT41Z=hBH+fUfOc4xsFAGg=Niv7Jgkqsg@mail.gmail.com>
	<56674280.3010003@gmail.com>
Date: Tue, 8 Dec 2015 16:23:12 -0500
Message-ID: <CABCnA7Vb1JA6E+heXZZ=DKcsK9gusa6tSNEL5AkGRLOT2ZND6w@mail.gmail.com>
From: Akiva Lichtner <akiva.lichtner@gmail.com>
To: Patrick Strateman <patrick.strateman@gmail.com>
Content-Type: multipart/alternative; boundary=001a11479f50bfbc4705266994e6
X-Spam-Status: No, score=-2.7 required=5.0 tests=BAYES_00,DKIM_SIGNED,
	DKIM_VALID,DKIM_VALID_AU,FREEMAIL_FROM,HTML_MESSAGE,RCVD_IN_DNSWL_LOW
	autolearn=ham version=3.3.1
X-Spam-Checker-Version: SpamAssassin 3.3.1 (2010-03-16) on
	smtp1.linux-foundation.org
X-Mailman-Approved-At: Tue, 08 Dec 2015 21:24:25 +0000
Cc: Bitcoin Dev <bitcoin-dev@lists.linuxfoundation.org>
Subject: Re: [bitcoin-dev] Scaling by Partitioning
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: Tue, 08 Dec 2015 21:23:15 -0000

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

It's true that miners would have to be prepared to work on any partition. I
don't see where the number affects defeating double spending, what matters
is the nonce in the block that keeps the next successful miner random.

I expect that the number of miners would be ten times larger as well, so an
attacker would have no advantage working on one partition.

On Tue, Dec 8, 2015 at 3:50 PM, Patrick Strateman via bitcoin-dev <
bitcoin-dev@lists.linuxfoundation.org> wrote:

> Payment recipients would need to operate a daemon for each chain, thus
> guaranteeing no scaling advantage.
>
> (There are other issues, but I believe that to be enough of a show stopper
> not to continue).
>
> On 12/08/2015 08:27 AM, Akiva Lichtner via bitcoin-dev wrote:
>
> Hello,
>
> I am seeking some expert feedback on an idea for scaling Bitcoin. As a
> brief introduction: I work in the payment industry and I have twenty years'
> experience in development. I have some experience with process groups and
> ordering protocols too. I think I understand Satoshi's paper but I admit I
> have not read the source code.
>
> The idea is to run more than one simultaneous chain, each chain defeating
> double spending on only part of the coin. The coin would be partitioned by
> radix (or modulus, not sure what to call it.) For example in order to
> multiply throughput by a factor of ten you could run ten parallel chains,
> one would work on coin that ends in "0", one on coin that ends in "1", and
> so on up to "9".
>
> The number of chains could increase automatically over time based on the
> moving average of transaction volume.
>
> Blocks would have to contain the number of the partition they belong to,
> and miners would have to round-robin through partitions so that an attacker
> would not have an unfair advantage working on just one partition.
>
> I don't think there is much impact to miners, but clients would have to
> send more than one message in order to spend money. Client messages will
> need to enumerate coin using some sort of compression, to save space. This
> seems okay to me since often in computing client software does have to
> break things up in equal parts (e.g. memory pages, file system blocks,) and
> the client software could hide the details.
>
> Best wishes for continued success to the project.
>
> Regards,
> Akiva
>
> P.S. I found a funny anagram for SATOSHI NAKAMOTO: "NSA IS OOOK AT MATH"
>
>
>
> _______________________________________________
> bitcoin-dev mailing listbitcoin-dev@lists.linuxfoundation.orghttps://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev
>
>
>
> _______________________________________________
> bitcoin-dev mailing list
> bitcoin-dev@lists.linuxfoundation.org
> https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev
>
>

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

<div dir=3D"ltr"><div>It&#39;s true that miners would have to be prepared t=
o work on any partition. I don&#39;t see where the number affects defeating=
 double spending, what matters is the nonce in the block that keeps the nex=
t successful miner random.<br><br></div>I expect that the number of miners =
would be ten times larger as well, so an attacker would have no advantage w=
orking on one partition.<br></div><div class=3D"gmail_extra"><br><div class=
=3D"gmail_quote">On Tue, Dec 8, 2015 at 3:50 PM, Patrick Strateman via bitc=
oin-dev <span dir=3D"ltr">&lt;<a href=3D"mailto:bitcoin-dev@lists.linuxfoun=
dation.org" target=3D"_blank">bitcoin-dev@lists.linuxfoundation.org</a>&gt;=
</span> wrote:<br><blockquote class=3D"gmail_quote" style=3D"margin:0 0 0 .=
8ex;border-left:1px #ccc solid;padding-left:1ex">
 =20
   =20
 =20
  <div bgcolor=3D"#FFFFFF" text=3D"#000000">
    Payment recipients would need to operate a daemon for each chain,
    thus guaranteeing no scaling advantage.<br>
    <br>
    (There are other issues, but I believe that to be enough of a show
    stopper not to continue).<br>
    <br>
    <div>On 12/08/2015 08:27 AM, Akiva Lichtner
      via bitcoin-dev wrote:<br>
    </div>
    <blockquote type=3D"cite">
      <div dir=3D"ltr">
        <div>
          <div>
            <div>
              <div>
                <div>
                  <div>
                    <div>
                      <div>Hello,<br>
                        <br>
                      </div>
                      I am seeking some expert feedback on an idea for
                      scaling Bitcoin. As a brief introduction: I work
                      in the payment industry and I have twenty years&#39;
                      experience in development. I have some experience
                      with process groups and ordering protocols too. I
                      think I understand Satoshi&#39;s paper but I admit I
                      have not read the source code.<br>
                      <br>
                    </div>
                    The idea is to run more than one simultaneous chain,
                    each chain defeating double spending on only part of
                    the coin. The coin would be partitioned by radix (or
                    modulus, not sure what to call it.) For example in
                    order to multiply throughput by a factor of ten you
                    could run ten parallel chains, one would work on
                    coin that ends in &quot;0&quot;, one on coin that ends =
in &quot;1&quot;,
                    and so on up to &quot;9&quot;.<br>
                    <br>
                  </div>
                  The number of chains could increase automatically over
                  time based on the moving average of transaction
                  volume.<br>
                  <br>
                </div>
                Blocks would have to contain the number of the partition
                they belong to, and miners would have to round-robin
                through partitions so that an attacker would not have an
                unfair advantage working on just one partition.<br>
              </div>
              <div><br>
              </div>
              <div>I don&#39;t think there is much impact to miners, but
                clients would have to send more than one message in
                order to spend money. Client messages will need to
                enumerate coin using some sort of compression, to save
                space. This seems okay to me since often in computing
                client software does have to break things up in equal
                parts (e.g. memory pages, file system blocks,) and the
                client software could hide the details.<br>
              </div>
            </div>
            <div><br>
            </div>
            <div>Best wishes for continued success to the project.<br>
            </div>
            <div><br>
            </div>
            Regards,<br>
          </div>
          Akiva<br>
          <br>
        </div>
        P.S. I found a funny anagram for SATOSHI NAKAMOTO: &quot;NSA IS OOO=
K
        AT MATH&quot;<br>
        <br>
      </div>
      <br>
      <fieldset></fieldset>
      <br>
      <pre>_______________________________________________
bitcoin-dev mailing list
<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" target=3D"_blank">=
bitcoin-dev@lists.linuxfoundation.org</a>
<a href=3D"https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev" =
target=3D"_blank">https://lists.linuxfoundation.org/mailman/listinfo/bitcoi=
n-dev</a>
</pre>
    </blockquote>
    <br>
  </div>

<br>_______________________________________________<br>
bitcoin-dev mailing list<br>
<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org">bitcoin-dev@lists.=
linuxfoundation.org</a><br>
<a href=3D"https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev" =
rel=3D"noreferrer" target=3D"_blank">https://lists.linuxfoundation.org/mail=
man/listinfo/bitcoin-dev</a><br>
<br></blockquote></div><br></div>

--001a11479f50bfbc4705266994e6--