MIME-Version: 1.0
Date: Tue, 8 Dec 2015 11:27:18 -0500
Message-ID: <CABCnA7Wqz76m8qo5BYT41Z=hBH+fUfOc4xsFAGg=Niv7Jgkqsg@mail.gmail.com>
From: Akiva Lichtner <akiva.lichtner@gmail.com>
To: bitcoin-dev@lists.linuxfoundation.org
Content-Type: multipart/alternative; boundary=001a113a97e2846f50052665726b
Subject: [bitcoin-dev] Scaling by Partitioning
Precedence: list

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

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"

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

<div dir=3D"ltr"><div><div><div><div><div><div><div><div>Hello,<br><br></di=
v>I am seeking some expert feedback on an idea for scaling Bitcoin. As a br=
ief introduction: I work in the payment industry and I have twenty years=
9; experience in development. I have some experience with process groups an=
d ordering protocols too. I think I understand Satoshi&#39;s paper but I ad=
mit I have not read the source code.<br><br></div>The idea is to run more t=
han one simultaneous chain, each chain defeating double spending on only pa=
rt of the coin. The coin would be partitioned by radix (or modulus, not sur=
e 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 automatical=
ly over time based on the moving average of transaction volume.<br><br></di=
v>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. C=
lient messages will need to enumerate coin using some sort of compression, =
to save space. This seems okay to me since often in computing client softwa=
re does have to break things up in equal parts (e.g. memory pages, file sys=
tem 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 fun=
ny anagram for SATOSHI NAKAMOTO: &quot;NSA IS OOOK AT MATH&quot;<br><br></d=
iv>

--001a113a97e2846f50052665726b--