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
|
Return-Path: <gavinandresen@gmail.com>
Received: from smtp1.linuxfoundation.org (smtp1.linux-foundation.org
[172.17.192.35])
by mail.linuxfoundation.org (Postfix) with ESMTPS id 84355904
for <bitcoin-dev@lists.linuxfoundation.org>;
Thu, 3 Dec 2015 19:14:58 +0000 (UTC)
X-Greylist: whitelisted by SQLgrey-1.7.6
Received: from mail-lb0-f182.google.com (mail-lb0-f182.google.com
[209.85.217.182])
by smtp1.linuxfoundation.org (Postfix) with ESMTPS id 7DBCC125
for <bitcoin-dev@lists.linuxfoundation.org>;
Thu, 3 Dec 2015 19:14:57 +0000 (UTC)
Received: by lbbkw15 with SMTP id kw15so7664770lbb.0
for <bitcoin-dev@lists.linuxfoundation.org>;
Thu, 03 Dec 2015 11:14:55 -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=qsOMn9PT9CD6iIc2Fw9B8bisySx1h74j7gC9slrk7gM=;
b=cTDK+7JIIE2g3ebdGIxbd52sKGnkIDH1oB70Qmo+vbNnl8RTNaddfmDZgORETYwmJP
Ho5Fslvp1ipPa5in6yZewVY0oaS1Tlvn1itnobxHrBDfg0iLor3ri23biAzcAI0n1Gii
+ac2xMa0TBtQ7OJVwxr+pT8W8755WjYdpsy1A86EN/YZVoZZqmVkDGsSayhziNGshXTZ
D6fY700Oeew7q7Gf7sBwXNamT18dFqLEZKdmO3Sb7cuhrygEj29EgjoVHaulHYXK4RFI
P2WiAFbuVLHub3aFunsxGUq2M7sBdL3QknSa07z/82DmDbSBUvFlq0Zw3UfISFoX2hBg
xwCA==
MIME-Version: 1.0
X-Received: by 10.112.180.35 with SMTP id dl3mr6365464lbc.27.1449170095688;
Thu, 03 Dec 2015 11:14:55 -0800 (PST)
Received: by 10.25.22.95 with HTTP; Thu, 3 Dec 2015 11:14:55 -0800 (PST)
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
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
Cc: Bitcoin Dev <bitcoin-dev@lists.linuxfoundation.org>
Subject: Re: [bitcoin-dev] [BIP Draft] Datastream compression of Blocks and
Transactions
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: Thu, 03 Dec 2015 19:14:58 -0000
--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"><<a hr=
ef=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" target=3D"_blank">bitco=
in-dev@lists.linuxfoundation.org</a>></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'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--
|
