On Thu, Jul 17, 2014 at 2:35 PM, Kaz Wesley <kezi...@gmail.com> wrote: > A node should be able to forget invs it has seen without invalidating what > peers > know about its known txes. To allow for this, a node assembles a bloom > filter of
Another option would be to just guarantee to keep at least the last N sent in each direction to bound memory usage. N could be negotiated. Going more complex than that may not have wins enough to justify it... would be good to measure it. (If you're not aware of it, check out— https://en.bitcoin.it/wiki/User:Gmaxwell/block_network_coding for a more complex idea) ------------------------------------------------------------------------------ Want fast and easy access to all the code in your enterprise? Index and search up to 200,000 lines of code with a free copy of Black Duck Code Sight - the same software that powers the world's largest code search on Ohloh, the Black Duck Open Hub! Try it now. http://p.sf.net/sfu/bds _______________________________________________ Bitcoin-development mailing list Bitcoin-development@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/bitcoin-development
