<oembed><type>rich</type><version>1.0</version><author_name>npub1lwrwp8dzn9x5nqc7d735e0nuwxh0nyz5ezkfpjzr332efdxw9asq4z8zjm</author_name><author_url>https://nostr.ae/npub1lwrwp8dzn9x5nqc7d735e0nuwxh0nyz5ezkfpjzr332efdxw9asq4z8zjm</author_url><provider_name>njump</provider_name><provider_url>https://nostr.ae</provider_url><html>📅 Original date posted:2014-07-17&#xA;📝 Original message:I&#39;m moving this design document to a gist so that I can integrate&#xA;changes as they come up:&#xA;https://gist.github.com/kazcw/43c97d3924326beca87d&#xA;One thing that I think is an important improvement over my initial&#xA;idea is that the bloom filters don&#39;t need to be kept around and built&#xA;up, they can just be one-shot and clear any matching entries from the&#xA;set of known-knowns upon arrival -- provided a node is careful to&#xA;ensure the txes it wants to forget are known-known-known (which isn&#39;t&#xA;as bad as it sounds) to the peer it&#39;s telling it&#39;s forgetting them&#xA;when the forget-filter arrives.&#xA;&#xA;On Thu, Jul 17, 2014 at 3:46 PM, Gavin Andresen &lt;gavinandresen at gmail.com&gt; wrote:&#xA;&gt;&#xA;&gt; A couple of half-baked thoughts:&#xA;&gt;&#xA;&gt; On Thu, Jul 17, 2014 at 5:35 PM, Kaz Wesley &lt;keziahw at gmail.com&gt; wrote:&#xA;&gt;&gt;&#xA;&gt;&gt; If there&#39;s support for this proposal, I can begin working on the specific&#xA;&gt;&gt; implementation details, such as the bloom filters, message format, and&#xA;&gt;&gt; capability advertisment, and draft a BIP once I have a concrete proposal for&#xA;&gt;&gt; what those would look like and a corresponding precise cost/benefit analysis.&#xA;&gt;&#xA;&gt;&#xA;&gt; I&#39;d encourage you to code up a prototype first (or at the same time), in whatever programming language / networking library you&#39;re most familiar with.&#xA;&gt;&#xA;&gt; 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.&#xA;&gt;&#xA;&gt; Combining your optimizations with &#34;broadcast as many near-miss blocks as bandwidth will allow&#34; on a mining backbone network should allow insanely fast propagation of most newly solved blocks.&#xA;&gt;&#xA;&gt; --&#xA;&gt; --&#xA;&gt; Gavin Andresen&#xA;&#xA;Thanks Gavin, I am planning on working out the design details as I&#xA;work on a prototype. I have the beginnings of a previous shot at&#xA;implementing this in bitcoind to start from but my new design has some&#xA;important improvements to add to that.&#xA;&#xA;-kaz</html></oembed>