MIME-Version: 1.0
In-Reply-To: <CAPkFh0t9SwVOLrPnL7z80s-Rriezhqxn_3vXKYRxr6JVGNiUZQ@mail.gmail.com>
References: <565CD7D8.3070102@gmail.com>
	<90EF4E6C-9A71-4A35-A938-EAFC1A24DD24@mattcorallo.com>
	<CAPkFh0t9SwVOLrPnL7z80s-Rriezhqxn_3vXKYRxr6JVGNiUZQ@mail.gmail.com>
Date: Thu, 3 Dec 2015 14:14:55 -0500
Message-ID: <CABsx9T3+y6ip3cUW8jP-0n+1FS8t_FdX8fA42JaTO7qW5pMhzA@mail.gmail.com>
From: Gavin Andresen <gavinandresen@gmail.com>
To: =?UTF-8?Q?Emin_G=C3=BCn_Sirer?= <el33th4x0r@gmail.com>
Content-Type: multipart/alternative; boundary=089e01182b3ac5d4b505260334bb
Cc: Bitcoin Dev <bitcoin-dev@lists.linuxfoundation.org>
Subject: Re: [bitcoin-dev] [BIP Draft] Datastream compression of Blocks and
	Transactions
Precedence: list

--089e01182b3ac5d4b505260334bb
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

On Wed, Dec 2, 2015 at 1:57 PM, Emin G=C3=BCn Sirer <
bitcoin-dev@lists.linuxfoundation.org> wrote:

> How to Do It
>
> If we want to compress Bitcoin, a programming challenge/contest would be
> one of the best ways to find the best possible, Bitcoin-specific
> compressor. This is the kind of self-contained exercise that bright young
> hackers love to tackle. It'd bring in new programmers into the ecosystem,
> and many of us would love to discover the limits of compressibility for
> Bitcoin bits on a wire. And the results would be interesting even if the
> final compression engine is not enabled by default, or not even merged.
>

I love this idea. Lets build a standardized data set to test against using
real data from the network (has anybody done this yet?).

Something like:

Starting network topology:
list of:  nodeid, nodeid, network latency between the two peers

Changes to network topology:
list of:  nodeid, add/remove nodeid, time of change

Transaction broadcasts:
list of :  transaction, node id that first broadcast, time first broadcast

Block broadcasts:
list of :  block, node id that first broadcast, time first broadcast

Proposed transaction/block optimizations could then be measured against
this standard data set.


--=20
--
Gavin Andresen

--089e01182b3ac5d4b505260334bb
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 W=
ed, Dec 2, 2015 at 1:57 PM, Emin G=C3=BCn Sirer <span dir=3D"ltr">&lt;<a hr=
ef=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" target=3D"_blank">bitco=
in-dev@lists.linuxfoundation.org</a>&gt;</span> wrote:<br><blockquote class=
=3D"gmail_quote" style=3D"margin:0px 0px 0px 0.8ex;border-left-width:1px;bo=
rder-left-color:rgb(204,204,204);border-left-style:solid;padding-left:1ex">=
<div><span style=3D"font-size:12.8px">How to Do It</span></div><div><span s=
tyle=3D"font-size:12.8px"><br></span></div><div><span style=3D"font-size:12=
.8px">If we want to compress Bitcoin, a</span><span style=3D"font-size:12.8=
px">=C2=A0programming challenge/contest would be one of the best ways to fi=
nd the best possible, Bitcoin-specific compressor. This is the kind of self=
-contained exercise that bright </span><span style=3D"font-size:12.8px">you=
ng hackers love to tackle. It&#39;d bring in new programmers into the ecosy=
stem, and many of us would love to discover the limits of compressibility f=
or Bitcoin bits on a wire. And the results would be interesting even if the=
 final compression engine is not enabled by default, or not even merged.</s=
pan></div><div></div></blockquote></div><br>I love this idea. Lets build a =
standardized data set to test against using real data from the network (has=
 anybody done this yet?).</div><div class=3D"gmail_extra"><br></div><div cl=
ass=3D"gmail_extra">Something like:</div><div class=3D"gmail_extra"><br></d=
iv><div class=3D"gmail_extra">Starting network topology:</div><div class=3D=
"gmail_extra">list of: =C2=A0nodeid, nodeid, network latency between the tw=
o peers</div><div class=3D"gmail_extra"><br></div><div class=3D"gmail_extra=
">Changes to network topology:</div><div class=3D"gmail_extra">list of: =C2=
=A0nodeid, add/remove nodeid, time of change</div><div class=3D"gmail_extra=
"><br></div><div class=3D"gmail_extra">Transaction broadcasts:</div><div cl=
ass=3D"gmail_extra">list of : =C2=A0transaction, node id that first broadca=
st, time first broadcast</div><div class=3D"gmail_extra"><br></div><div cla=
ss=3D"gmail_extra">Block broadcasts:</div><div class=3D"gmail_extra">list o=
f : =C2=A0block, node id that first broadcast, time first broadcast</div><d=
iv class=3D"gmail_extra"><br></div><div class=3D"gmail_extra">Proposed tran=
saction/block optimizations could then be measured against this standard da=
ta set.</div><div class=3D"gmail_extra"><div><br></div><div><br></div>-- <b=
r><div class=3D"gmail_signature">--<br>Gavin Andresen<br></div>
</div></div>

--089e01182b3ac5d4b505260334bb--