def test_knapsack_solver_two_coins_exact_match(generate_utxo_pool):
utxo_pool = generate_utxo_pool([1 * CENT, 2 * CENT])
selection = select_coins_knapsack_solver(utxo_pool, 3 * CENT)
assert len(selection.outputs) == 2
assert selection.effective_value == 3 * CENT
def test_knapsack_solver_insifficient_funds(generate_utxo_pool):
utxo_pool = generate_utxo_pool([])
selection = select_coins_knapsack_solver(utxo_pool, 1 * CENT)
assert len(selection.outputs) == 0
assert selection.effective_value == 0
def test_knapsack_solver_large_pool_many_coins_approx_match(generate_utxo_pool):
utxo_pool = generate_utxo_pool(
[5 * CENT, 6 * CENT, 7 * CENT, 8 * CENT, 20 * CENT, 30 * CENT])
selection = select_coins_knapsack_solver(utxo_pool, 16 * CENT)
assert len(selection.outputs) == 3
assert selection.effective_value == 18 * CENT
def test_knapsack_solver_large_pool_insufficient_funds(generate_utxo_pool):
utxo_pool = generate_utxo_pool(
[6 * CENT, 7 * CENT, 8 * CENT, 20 * CENT, 30 * CENT])
selection = select_coins_knapsack_solver(utxo_pool, 72 * CENT)
assert len(selection.outputs) == 0
assert selection.effective_value == 0
def test_knapsack_solver_large_pool_single_large_coin_vs_many_coins_tie(generate_utxo_pool):
utxo_pool = generate_utxo_pool(
[5 * CENT, 6 * CENT, 7 * CENT, 8 * CENT, 18 * CENT, 20 * CENT, 30 * CENT])
selection = select_coins_knapsack_solver(utxo_pool, 16 * CENT)
assert len(selection.outputs) == 1
assert selection.effective_value == 18 * CENT
def test_knapsack_solver_large_pool_exact_match_2(generate_utxo_pool):
utxo_pool = generate_utxo_pool(
[5 * CENT, 6 * CENT, 7 * CENT, 8 * CENT, 18 * CENT, 20 * CENT, 30 * CENT])
selection = select_coins_knapsack_solver(utxo_pool, 11 * CENT)
assert len(selection.outputs) == 2
assert selection.effective_value == 11 * CENT
def test_knapsack_solver_single_coin_exact_match(generate_utxo_pool):
utxo_pool = generate_utxo_pool([1 * CENT])
selection = select_coins_knapsack_solver(utxo_pool, 1 * CENT)
assert len(selection.outputs) == 1
assert selection.effective_value == 1 * CENT
def test_branch_and_bound_early_bailout_optimization(generate_utxo_pool):
utxo_pool = generate_utxo_pool(
[2 * CENT, 7 * CENT, 7 * CENT, 7 * CENT, 7 * CENT] +
[5 * CENT for i in range(50000)])
selection = select_coins_branch_and_bound(utxo_pool, 30 * CENT, 5000,
DEFAULT_NOT_INPUT_FEES)
assert len(selection.outputs) == 5
assert selection.effective_value == 30 * CENT
def test_branch_and_bound_consistently_fails_impossible_case(
generate_utxo_pool):
utxo_pool = generate_utxo_pool([i * CENT for i in range(5, 21)])
for i in range(100):
selection = select_coins_branch_and_bound(utxo_pool, 1 * CENT,
2 * CENT,
DEFAULT_NOT_INPUT_FEES)
assert len(selection.outputs) == 0
assert selection.effective_value == 0
def test_branch_and_bound_impossible(generate_utxo_pool):
utxo_pool = generate_utxo_pool(
[1 * CENT, 2 * CENT, 3 * CENT, 4 * CENT, 5 * CENT])
selection = select_coins_branch_and_bound(utxo_pool, 0.25 * CENT,
0.5 * CENT,
DEFAULT_NOT_INPUT_FEES)
assert len(selection.outputs) == 0
assert selection.effective_value == 0
def test_knapsack_solver_randomness_1(generate_utxo_pool):
utxo_pool = generate_utxo_pool(
[COIN for i in range(100)])
for i in range(RUN_TESTS):
selection_1 = select_coins_knapsack_solver(utxo_pool, 50 * COIN)
selection_2 = select_coins_knapsack_solver(utxo_pool, 50 * COIN)
assert selection_1.effective_value == selection_1.effective_value == 50 * COIN
assert set(selection_1.outputs) != set(selection_2.outputs)
def test_knapsack_solver_avoids_small_change_1(generate_utxo_pool):
utxo_pool = generate_utxo_pool([
MIN_CHANGE * 1 / 10,
MIN_CHANGE * 2 / 10,
MIN_CHANGE * 3 / 10,
MIN_CHANGE * 4 / 10,
MIN_CHANGE * 5 / 10
])
selection = select_coins_knapsack_solver(utxo_pool, MIN_CHANGE)
assert selection.effective_value == MIN_CHANGE
def test_knapsack_solver_avoids_small_change_4(generate_utxo_pool):
utxo_pool = generate_utxo_pool([
MIN_CHANGE * 5 / 10,
MIN_CHANGE * 6 / 10,
MIN_CHANGE * 7 / 10,
1111 * MIN_CHANGE
])
selection = select_coins_knapsack_solver(utxo_pool, MIN_CHANGE)
assert len(selection.outputs) == 1
assert selection.effective_value == 1111 * MIN_CHANGE
def test_knapsack_solver_avoids_small_change_6(generate_utxo_pool):
utxo_pool = generate_utxo_pool([
MIN_CHANGE * 5 / 100,
MIN_CHANGE,
MIN_CHANGE * 100
])
selection = select_coins_knapsack_solver(
utxo_pool, MIN_CHANGE * 9990 / 100)
assert len(selection.outputs) == 2
assert selection.effective_value == 101 * MIN_CHANGE
def test_branch_and_bound_insufficient_funds(generate_utxo_pool):
utxo_pool = generate_utxo_pool([
1 * CENT,
2 * CENT,
3 * CENT,
4 * CENT,
])
selection = select_coins_branch_and_bound(utxo_pool, 11 * CENT, 0.5 * CENT,
DEFAULT_NOT_INPUT_FEES)
assert len(selection.outputs) == 0
assert selection.effective_value == 0
def test_branch_and_bound_cheap_change(generate_utxo_pool):
utxo_pool = generate_utxo_pool([
1 * CENT,
2 * CENT,
3 * CENT,
4 * CENT,
])
selection = select_coins_branch_and_bound(utxo_pool, 0.9 * CENT, 0,
DEFAULT_NOT_INPUT_FEES)
assert len(selection.outputs) == 0
assert selection.effective_value == 0
def test_knapsack_solver_randomness_2(generate_utxo_pool):
utxo_pool = generate_utxo_pool(
[5 * CENT, 10 * CENT, 15 * CENT, 20 * CENT, 25 * CENT]
+ [COIN for i in range(1000)]
)
for i in range(RUN_TESTS):
selection_1 = select_coins_knapsack_solver(utxo_pool, 90 * CENT)
selection_2 = select_coins_knapsack_solver(utxo_pool, 90 * CENT)
assert selection_1.effective_value == selection_1.effective_value == COIN
assert set(selection_1.outputs) != set(selection_2.outputs)
def test_branch_and_bound_exact_match_single_coin(generate_utxo_pool,
target_amount):
utxo_pool = generate_utxo_pool([
1 * CENT,
2 * CENT,
3 * CENT,
4 * CENT,
])
selection = select_coins_branch_and_bound(utxo_pool, target_amount,
0.5 * CENT,
DEFAULT_NOT_INPUT_FEES)
assert len(selection.outputs) == 1
assert selection.effective_value == target_amount
assert selection.outputs[0].effective_value == target_amount
def test_branch_and_bound_exact_match_multiple_coins(generate_utxo_pool):
utxo_pool = generate_utxo_pool(
[1 * CENT, 2 * CENT, 3 * CENT, 4 * CENT, 5 * CENT])
selection = select_coins_branch_and_bound(utxo_pool, 10 * CENT, 0.5 * CENT,
DEFAULT_NOT_INPUT_FEES)
assert len(selection.outputs) == 3
assert selection.effective_value == 10 * CENT
selected_amounts = [output.effective_value for output in selection.outputs]
selected_amounts.sort()
assert selected_amounts[0] == 1 * CENT
assert selected_amounts[1] == 4 * CENT
assert selected_amounts[2] == 5 * CENT
def test_knapsack_solver_smallest_larger_coin_used(generate_utxo_pool):
utxo_pool = generate_utxo_pool([
5 * CENT,
6 * CENT,
7 * CENT,
8 * CENT,
18 * CENT,
20 * CENT,
30 * CENT,
1 * COIN,
2 * COIN,
3 * COIN
])
selection = select_coins_knapsack_solver(utxo_pool, 95 * CENT)
assert len(selection.outputs) == 1
assert selection.effective_value == 1 * COIN
selection = select_coins_knapsack_solver(utxo_pool, 195 * CENT)
assert len(selection.outputs) == 1
assert selection.effective_value == 2 * COIN
def test_knapsack_solver_many_inputs(generate_utxo_pool):
currnet_amount = 1500
while currnet_amount < COIN:
# Create 676 inputs (= (old MAX_STANDARD_TX_SIZE == 100000) / 148 bytes per input)
MAX_INPUTS = 676
utxo_pool = generate_utxo_pool(
[currnet_amount for i in range(MAX_INPUTS)])
for i in range(100):
selection = select_coins_knapsack_solver(utxo_pool, 2000)
if currnet_amount - 2000 < MIN_CHANGE:
# needs more than one input
return_size = math.ceil((2000.0 + MIN_CHANGE) / currnet_amount)
return_value = currnet_amount * return_size
assert len(selection.outputs) == return_size
assert selection.effective_value == return_value
else:
# one input is sufficient
assert selection.effective_value == currnet_amount
assert len(selection.outputs) == 1
currnet_amount *= 10
def test_knapsack_solver_mt_gox(generate_utxo_pool):
utxo_pool = generate_utxo_pool([50000 * COIN for i in range(20)])
selection = select_coins_knapsack_solver(utxo_pool, 500000 * COIN)
assert len(selection.outputs) == 10
assert selection.effective_value == 500000 * COIN
