{"push_id":1053910550,"size":1,"distinct_size":1,"ref":"refs/heads/sorted_invs","head":"19b9e051e7ee3eb66a033a08be8b7d40c2babcf5","before":"223fdd1d82ad2029091ad9d18eef016825c273a2","commits":[{"sha":"19b9e051e7ee3eb66a033a08be8b7d40c2babcf5","author":{"email":"79e2475f81a6317276bf7cbb3958b20d289b78df@xiph.org","name":"Gregory Maxwell"},"message":"Eliminate TX trickle bypass, sort TX invs for privacy and priority.\n\nPreviously Bitcoin would send 1/4 of transactions out to all peers\n instantly.  This causes high overhead because it makes >80% of\n INVs size 1.  Doing so harms privacy, because it limits the\n amount of source obscurity a transaction can receive.\n\nThese randomized broadcasts also disobeyed transaction dependencies\n and required use of the orphan pool.  Because the orphan pool is\n so small this leads to poor propagation for dependent transactions.\n\nWhen the bypass wasn't in effect, transactions were sent in the\n order they were received.  This avoided creating orphans but\n undermines privacy fairly significantly.\n\nThis commit:\n Eliminates the bypass. The bypass is replaced by halving the\n  average delay for outbound peers.\n\n Sorts candidate transactions for INV by their topological\n  depth then by their feerate (then hash); removing the\n  information leakage and providing priority service to\n  higher fee transactions.\n\n Limits the amount of transactions sent in a single INV to\n  7tx/sec (and twice that for outbound); this limits the\n  harm of low fee transaction floods, gives faster relay\n  service to higher fee transactions. The 7 sounds lower\n  than it really is because received advertisements need\n  not be sent, and because the aggregate rate is multipled\n  by the number of peers.","distinct":true,"url":"https://api.github.com/repos/gmaxwell/bitcoin/commits/19b9e051e7ee3eb66a033a08be8b7d40c2babcf5"}]}