slackcoder/bitcoin - Bitcoin Code integration/staging tree

Age	Commit message (Collapse)	Author
2017-02-23	Fix docstrings in qa tests	John Newbery
	This commit fixes the module-level docstrings for the tests and helper modules in qa. Many of these tests were uncommented previously - this commit ensures that every test case has at least a minimum level of commenting.
2016-12-03	remove relaypriority from rpc tests	Alex Morcos

2016-06-09	Merge #7292: [RPC] Expose ancestor/descendant information over RPC	Pieter Wuille
	176e19b Mention new RPC's in release notes (Suhas Daftuar) 7f6eda8 Add ancestor statistics to mempool entry RPC output (Suhas Daftuar) a9b8390 Add test coverage for new RPC calls (Suhas Daftuar) b09b813 Add getmempoolentry RPC call (Suhas Daftuar) 0dfd869 Add getmempooldescendants RPC call (Suhas Daftuar) 8f7b5dc Add getmempoolancestors RPC call (Suhas Daftuar) 5ec0cde Refactor logic for converting mempool entries to JSON (Suhas Daftuar)
2016-06-09	Add test coverage for new RPC calls	Suhas Daftuar

2016-05-15	[qa] Remove hardcoded "4 nodes" from test_framework	MarcoFalke

2016-05-05	[qa] Switch to py3	MarcoFalke

2016-03-17	Tests: fix missing import in mempool_packages	Suhas Daftuar

2016-03-14	[qa] mininode: Add and use CONSTs	MarcoFalke

2016-01-14	Eliminate race condition in mempool_packages test	Suhas Daftuar

2015-12-02	Fix mempool limiting for PrioritiseTransaction	Suhas Daftuar
	Redo the feerate index to be based on mining score, rather than fee. Update mempool_packages.py to test prioritisetransaction's effect on package scores.
2015-12-01	Add rounding helper function to util.py	Suhas Daftuar

2015-10-27	Lower default policy limits	Alex Morcos
	Reduce the default limits on maximum number of transactions and the cumulative size of those transactions in both ancestor and descendant packages to 25 txs and 101kb total size.
2015-09-23	Add test showing bug in mempool packages	Suhas Daftuar

2015-09-19	Track transaction packages in CTxMemPoolEntry	Suhas Daftuar
	Associate with each CTxMemPoolEntry all the size/fees of descendant mempool transactions. Sort mempool by max(feerate of entry, feerate of descendants). Update statistics on-the-fly as transactions enter or leave the mempool. Also add ancestor and descendant limiting, so that transactions can be rejected if the number or size of unconfirmed ancestors exceeds a target, or if adding a transaction would cause some other mempool entry to have too many (or too large) a set of unconfirmed in- mempool descendants.