You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

smartfees.py 3.9KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889
  1. #!/usr/bin/env python
  2. #
  3. # Test fee estimation code
  4. #
  5. from test_framework import BitcoinTestFramework
  6. from bitcoinrpc.authproxy import AuthServiceProxy, JSONRPCException
  7. from util import *
  8. class EstimateFeeTest(BitcoinTestFramework):
  9. def setup_network(self, test_dir):
  10. nodes = []
  11. nodes.append(start_node(0, test_dir,
  12. ["-debug=mempool", "-debug=estimatefee"]))
  13. # Node1 mines small-but-not-tiny blocks, and allows free transactions.
  14. # NOTE: the CreateNewBlock code starts counting block size at 1,000 bytes,
  15. # so blockmaxsize of 2,000 is really just 1,000 bytes (room enough for
  16. # 6 or 7 transactions)
  17. nodes.append(start_node(1, test_dir,
  18. ["-blockprioritysize=1500", "-blockmaxsize=2000",
  19. "-debug=mempool", "-debug=estimatefee"]))
  20. connect_nodes(nodes[1], 0)
  21. # Node2 is a stingy miner, that
  22. # produces very small blocks (room for only 3 or so transactions)
  23. node2args = [ "-blockprioritysize=0", "-blockmaxsize=1500",
  24. "-debug=mempool", "-debug=estimatefee"]
  25. nodes.append(start_node(2, test_dir, node2args))
  26. connect_nodes(nodes[2], 0)
  27. sync_blocks(nodes)
  28. return nodes
  29. def run_test(self, nodes):
  30. # Prime the memory pool with pairs of transactions
  31. # (high-priority, random fee and zero-priority, random fee)
  32. min_fee = Decimal("0.001")
  33. fees_per_kb = [];
  34. for i in range(12):
  35. (txid, txhex, fee) = random_zeropri_transaction(nodes, Decimal("1.1"),
  36. min_fee, min_fee, 20)
  37. tx_kbytes = (len(txhex)/2)/1000.0
  38. fees_per_kb.append(float(fee)/tx_kbytes)
  39. # Mine blocks with node2 until the memory pool clears:
  40. count_start = nodes[2].getblockcount()
  41. while len(nodes[2].getrawmempool()) > 0:
  42. nodes[2].setgenerate(True, 1)
  43. sync_blocks(nodes)
  44. all_estimates = [ nodes[0].estimatefee(i) for i in range(1,20) ]
  45. print("Fee estimates, super-stingy miner: "+str([str(e) for e in all_estimates]))
  46. # Estimates should be within the bounds of what transactions fees actually were:
  47. delta = 1.0e-6 # account for rounding error
  48. for e in filter(lambda x: x >= 0, all_estimates):
  49. if float(e)+delta < min(fees_per_kb) or float(e)-delta > max(fees_per_kb):
  50. raise AssertionError("Estimated fee (%f) out of range (%f,%f)"%(float(e), min_fee_kb, max_fee_kb))
  51. # Generate transactions while mining 30 more blocks, this time with node1:
  52. for i in range(30):
  53. for j in range(random.randrange(6-4,6+4)):
  54. (txid, txhex, fee) = random_transaction(nodes, Decimal("1.1"),
  55. Decimal("0.0"), min_fee, 20)
  56. tx_kbytes = (len(txhex)/2)/1000.0
  57. fees_per_kb.append(float(fee)/tx_kbytes)
  58. nodes[1].setgenerate(True, 1)
  59. sync_blocks(nodes)
  60. all_estimates = [ nodes[0].estimatefee(i) for i in range(1,20) ]
  61. print("Fee estimates, more generous miner: "+str([ str(e) for e in all_estimates]))
  62. for e in filter(lambda x: x >= 0, all_estimates):
  63. if float(e)+delta < min(fees_per_kb) or float(e)-delta > max(fees_per_kb):
  64. raise AssertionError("Estimated fee (%f) out of range (%f,%f)"%(float(e), min_fee_kb, max_fee_kb))
  65. # Finish by mining a normal-sized block:
  66. while len(nodes[0].getrawmempool()) > 0:
  67. nodes[0].setgenerate(True, 1)
  68. sync_blocks(nodes)
  69. final_estimates = [ nodes[0].estimatefee(i) for i in range(1,20) ]
  70. print("Final fee estimates: "+str([ str(e) for e in final_estimates]))
  71. if __name__ == '__main__':
  72. EstimateFeeTest().main()