Received-SPF: pass (sog-mx-3.v43.ch3.sourceforge.com: domain of gmail.com
	designates 209.85.216.175 as permitted sender)
	client-ip=209.85.216.175; envelope-from=etotheipi@gmail.com;
	helo=mail-qc0-f175.google.com; 
Message-ID: <4FDE2460.5080301@gmail.com>
Date: Sun, 17 Jun 2012 14:39:28 -0400
From: Alan Reiner <etotheipi@gmail.com>
User-Agent: Mozilla/5.0 (X11; Linux i686 on x86_64;
	rv:12.0) Gecko/20120428 Thunderbird/12.0.1
MIME-Version: 1.0
To: Bitcoin Dev <bitcoin-development@lists.sourceforge.net>
Content-Type: multipart/alternative;
	boundary="------------010001080507030909020409"
Subject: [Bitcoin-development] Ultimate Blockchain Compression w/ trust-free
	lite nodes
Precedence: list

This is a multi-part message in MIME format.
--------------010001080507030909020409
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit

All,

With the flurry of discussion about blockchain compression, I thought it 
was time to put forward my final, most-advanced idea, into a single, 
well-thought-out, *illustrated*, forum post.     Please check it out: 
https://bitcointalk.org/index.php?topic=88208.0

This is a huge undertaking, but it has some pretty huge benefits.  And 
it's actually feasible because it can be implemented without disrupting 
the main network.  I'm sure there's lots of issues with it, but I'm 
putting it out there to see how it might be improved and actually executed.

----
*Summary:

*/Use a special tree data structure to organize all unspent-TxOuts on 
the network, and use the root of this tree to communicate its 
"signature" between nodes.  The leaves of this tree actually correspond 
to addresses/scripts, and the data at the leaf is actually a root of the 
unspent-TxOut list for that address/script.  To maintain security of the 
tree signatures, it will be included in the header of an alternate 
blockchain, which will be secured by merged mining.

This provides the same compression as the simpler unspent-TxOut merkle 
tree, but also gives nodes a way to download just the unspent-TxOut list 
for each address in their wallet, and verify that list directly against 
the blockheaders.  Therefore, even lightweight nodes can get full 
address information, from any untrusted peer, and with only a tiny 
amount of downloaded data (a few kB). /*
*----

Alright, tear it up!
-Alan


--------------010001080507030909020409
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit

<html>
  <head>

    <meta http-equiv="content-type" content="text/html; charset=ISO-8859-1">
  </head>
  <body text="#000000" bgcolor="#FFFFFF">
    All,<br>
    <br>
    With the flurry of discussion about blockchain compression, I
    thought it was time to put forward my final, most-advanced idea,
    into a single, well-thought-out, <b>illustrated</b>, forum
    post.&nbsp;&nbsp;&nbsp;&nbsp; Please check it out:&nbsp;
    <meta http-equiv="content-type" content="text/html;
      charset=ISO-8859-1">
    <a href="https://bitcointalk.org/index.php?topic=88208.0">https://bitcointalk.org/index.php?topic=88208.0</a><br>
    <br>
    This is a huge undertaking, but it has some pretty huge benefits.&nbsp;
    And it's actually feasible because it can be implemented without
    disrupting the main network.&nbsp; I'm sure there's lots of issues with
    it, but I'm putting it out there to see how it might be improved and
    actually executed.&nbsp; <br>
    <br>
    ----
    <meta http-equiv="content-type" content="text/html;
      charset=ISO-8859-1">
    <br>
    <b>Summary:<br>
      <br>
    </b><i>Use a special tree data structure to organize all
      unspent-TxOuts on the network, and use the root of this tree to
      communicate its "signature" between nodes.&nbsp; The leaves of this
      tree actually correspond to addresses/scripts, and the data at the
      leaf is actually a root of the unspent-TxOut list for that
      address/script.&nbsp; To maintain security of the tree signatures, it
      will be included in the header of an alternate blockchain, which
      will be secured by merged mining.&nbsp; <br>
      <br>
      This provides the same compression as the simpler unspent-TxOut
      merkle tree, but also gives nodes a way to download just the
      unspent-TxOut list for each address in their wallet, and verify
      that list directly against the blockheaders.&nbsp; Therefore, even
      lightweight nodes can get full address information, from any
      untrusted peer, and with only a tiny amount of downloaded data (a
      few kB).&nbsp; </i><b><br>
    </b>----<br>
    <br>
    Alright, tear it up!<br>
    -Alan<br>
    <br>
  </body>
</html>

--------------010001080507030909020409--