📅 Original date posted:2015-12-03
📝 Original message:On Wed, Dec 2, 2015 at 1:57 PM, Emin Gün Sirer <
bitcoin-dev at 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.
--
--
Gavin Andresen
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20151203/fd6a0dcd/attachment.html>;
Gavin Andresen [ARCHIVE] /
npub1s4…d44kw
2023-06-07 17:45:26
in reply to nevent1q…rz76
Author Public Key
npub1s4lj77xuzcu7wy04afcr487f0r3za0f8n2775xrpkld2sv639mjqsd44kwPublished at
2023-06-07 17:45:26Event JSON
{
"id": "1d99e97982ff294062b96369f4d60935b69dd8e74b027f9c68be1d006f3cfc5c",
"pubkey": "857f2f78dc1639e711f5ea703a9fc978e22ebd279abdea1861b7daa833512ee4",
"created_at": 1686159926,
"kind": 1,
"tags": [
[
"e",
"66e2fed0b01e52e71a1dd6b42fe6a9fda1f0a599c3d79a1ed608f15fbb8c1ad3",
"",
"root"
],
[
"e",
"beed275636c7142ad409ea5b439adb1d6b13eb1b6628a315a35e14f15ffff11b",
"",
"reply"
],
[
"p",
"cd753aa8fbc112e14ffe9fe09d3630f0eff76ca68e376e004b8e77b687adddba"
]
],
"content": "📅 Original date posted:2015-12-03\n📝 Original message:On Wed, Dec 2, 2015 at 1:57 PM, Emin Gün Sirer \u003c\nbitcoin-dev at lists.linuxfoundation.org\u003e wrote:\n\n\u003e How to Do It\n\u003e\n\u003e If we want to compress Bitcoin, a programming challenge/contest would be\n\u003e one of the best ways to find the best possible, Bitcoin-specific\n\u003e compressor. This is the kind of self-contained exercise that bright young\n\u003e hackers love to tackle. It'd bring in new programmers into the ecosystem,\n\u003e and many of us would love to discover the limits of compressibility for\n\u003e Bitcoin bits on a wire. And the results would be interesting even if the\n\u003e final compression engine is not enabled by default, or not even merged.\n\u003e\n\nI love this idea. Lets build a standardized data set to test against using\nreal data from the network (has anybody done this yet?).\n\nSomething like:\n\nStarting network topology:\nlist of: nodeid, nodeid, network latency between the two peers\n\nChanges to network topology:\nlist of: nodeid, add/remove nodeid, time of change\n\nTransaction broadcasts:\nlist of : transaction, node id that first broadcast, time first broadcast\n\nBlock broadcasts:\nlist of : block, node id that first broadcast, time first broadcast\n\nProposed transaction/block optimizations could then be measured against\nthis standard data set.\n\n\n-- \n--\nGavin Andresen\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20151203/fd6a0dcd/attachment.html\u003e",
"sig": "7a12a5832262368d31612295845fb8e655026da6bb77bdc609c6d191c35b0c0b5117df61424dcad1258b09ab87026e8ac3dd761b678aa1a8e5b7ef14414bc7ac"
}