{"type":"rich","version":"1.0","author_name":"npub1lwrwp8dzn9x5nqc7d735e0nuwxh0nyz5ezkfpjzr332efdxw9asq4z8zjm","author_url":"https://nostr.ae/npub1lwrwp8dzn9x5nqc7d735e0nuwxh0nyz5ezkfpjzr332efdxw9asq4z8zjm","provider_name":"njump","provider_url":"https://nostr.ae","html":"📅 Original date posted:2014-07-17\n📝 Original message:I'm moving this design document to a gist so that I can integrate\nchanges as they come up:\nhttps://gist.github.com/kazcw/43c97d3924326beca87d\nOne thing that I think is an important improvement over my initial\nidea is that the bloom filters don't need to be kept around and built\nup, they can just be one-shot and clear any matching entries from the\nset of known-knowns upon arrival -- provided a node is careful to\nensure the txes it wants to forget are known-known-known (which isn't\nas bad as it sounds) to the peer it's telling it's forgetting them\nwhen the forget-filter arrives.\n\nOn Thu, Jul 17, 2014 at 3:46 PM, Gavin Andresen \u003cgavinandresen at gmail.com\u003e wrote:\n\u003e\n\u003e A couple of half-baked thoughts:\n\u003e\n\u003e On Thu, Jul 17, 2014 at 5:35 PM, Kaz Wesley \u003ckeziahw at gmail.com\u003e wrote:\n\u003e\u003e\n\u003e\u003e If there's support for this proposal, I can begin working on the specific\n\u003e\u003e implementation details, such as the bloom filters, message format, and\n\u003e\u003e capability advertisment, and draft a BIP once I have a concrete proposal for\n\u003e\u003e what those would look like and a corresponding precise cost/benefit analysis.\n\u003e\n\u003e\n\u003e I'd encourage you to code up a prototype first (or at the same time), in whatever programming language / networking library you're most familiar with.\n\u003e\n\u003e Maybe not even using the existing p2p protocol; there could be a mining-only very-fast-block-propagation network separate from the existing p2p network.\n\u003e\n\u003e Combining your optimizations with \"broadcast as many near-miss blocks as bandwidth will allow\" on a mining backbone network should allow insanely fast propagation of most newly solved blocks.\n\u003e\n\u003e --\n\u003e --\n\u003e Gavin Andresen\n\nThanks Gavin, I am planning on working out the design details as I\nwork on a prototype. I have the beginnings of a previous shot at\nimplementing this in bitcoind to start from but my new design has some\nimportant improvements to add to that.\n\n-kaz"}