Nucypher
/
nucypher
mirror of https://github.com/nucypher/nucypher.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

This entire test (and part of another) is no longer relevant, as Alice and Bob will learn about seednodes form their hardcoded domain list in such a scenario.

pull/2175/head
jMyles 2020-06-24 19:27:52 -07:00
parent 392d51f711
commit cc7e96f671
1 changed files with 4 additions and 40 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

44
tests/integration/network/test_failure_modes.py
View File

@ -31,30 +31,6 @@ from tests.utils.middleware import EvilMiddleWare, NodeIsDownMiddleware
from tests.utils.ursula import make_federated_ursulas
def test_bob_does_not_let_a_connection_error_stop_him(enacted_federated_policy,
federated_ursulas,
federated_bob,
federated_alice):
assert len(federated_bob.known_nodes) == 0
ursula1 = list(federated_ursulas)[0]
ursula2 = list(federated_ursulas)[1]
federated_bob.remember_node(ursula1)
federated_bob.network_middleware = NodeIsDownMiddleware()
federated_bob.network_middleware.node_is_down(ursula1)
with pytest.raises(federated_bob.NotEnoughNodes):
federated_bob.get_treasure_map(federated_alice.stamp, enacted_federated_policy.label)
federated_bob.remember_node(ursula2)
map = federated_bob.get_treasure_map(federated_alice.stamp, enacted_federated_policy.label)
assert sorted(list(map.destinations.keys())) == sorted(
list(u.checksum_address for u in list(federated_ursulas)))
def test_alice_can_grant_even_when_the_first_nodes_she_tries_are_down(federated_alice, federated_bob, federated_ursulas):
m, n = 2, 3
policy_end_datetime = maya.now() + datetime.timedelta(days=5)
@ -80,22 +56,6 @@ def test_alice_can_grant_even_when_the_first_nodes_she_tries_are_down(federated_
# Go!
federated_alice.start_learning_loop()
# Try a first time, failing because no known nodes are up for Alice to even try to learn from.
with pytest.raises(down_node.NotEnoughNodes):
alice_grant_action()
# Now she learn about one node that *is* up...
reliable_node = list(federated_ursulas)[1]
federated_alice.remember_node(reliable_node)
# ...amidst a few others that are down.
more_nodes = list(federated_ursulas)[2:10]
for node in more_nodes:
federated_alice.network_middleware.node_is_down(node)
# Alice still only knows about two nodes (the one that is down and the new one).
assert len(federated_alice.known_nodes) == 2
# Now we'll have a situation where Alice knows about all 10,
# though only one is up.
@ -103,6 +63,10 @@ def test_alice_can_grant_even_when_the_first_nodes_she_tries_are_down(federated_
# Because she has successfully completed learning, but the nodes about which she learned are down,
# she'll get a different error.
more_nodes = list(federated_ursulas)[1:10]
for node in more_nodes:
federated_alice.network_middleware.node_is_down(node)
for node in more_nodes:
federated_alice.remember_node(node)
with pytest.raises(Policy.Rejected):