mirror of https://github.com/nucypher/nucypher.git
93 lines
2.8 KiB
Python
93 lines
2.8 KiB
Python
|
|
|
|
|
|
import datetime
|
|
from functools import partial
|
|
|
|
import maya
|
|
import pytest
|
|
|
|
from nucypher.policy.policies import Policy
|
|
from tests.constants import MOCK_ETH_PROVIDER_URI
|
|
from tests.utils.middleware import NodeIsDownMiddleware
|
|
|
|
|
|
def test_alice_can_grant_even_when_the_first_nodes_she_tries_are_down(
|
|
alice, bob, ursulas
|
|
):
|
|
threshold, shares = 2, 3
|
|
policy_end_datetime = maya.now() + datetime.timedelta(days=5)
|
|
label = b"this_is_the_path_to_which_access_is_being_granted"
|
|
alice.known_nodes.current_state._nodes = {}
|
|
|
|
alice.network_middleware = NodeIsDownMiddleware(
|
|
eth_provider_uri=MOCK_ETH_PROVIDER_URI
|
|
)
|
|
|
|
# OK, her first and only node is down.
|
|
down_node = list(ursulas)[0]
|
|
alice.remember_node(down_node)
|
|
alice.network_middleware.node_is_down(down_node)
|
|
|
|
# Here's the command we want to run.
|
|
alice_grant_action = partial(
|
|
alice.grant,
|
|
bob,
|
|
label,
|
|
threshold=threshold,
|
|
shares=shares,
|
|
expiration=policy_end_datetime,
|
|
timeout=0.1,
|
|
)
|
|
|
|
# Go!
|
|
alice.start_learning_loop()
|
|
|
|
# Now we'll have a situation where Alice knows about all 10,
|
|
# though only one is up.
|
|
|
|
# She'll try to learn about more, but there aren't any.
|
|
# Because she has successfully completed learning, but the nodes about which she learned are down,
|
|
# she'll get a different error.
|
|
|
|
more_nodes = list(ursulas)[1:10]
|
|
for node in more_nodes:
|
|
alice.network_middleware.node_is_down(node)
|
|
|
|
for node in more_nodes:
|
|
alice.remember_node(node)
|
|
with pytest.raises(Policy.NotEnoughUrsulas):
|
|
alice_grant_action()
|
|
|
|
# Now let's let a few of them come up.
|
|
for node in more_nodes[0:4]:
|
|
alice.network_middleware.node_is_up(node)
|
|
|
|
# Now the same exact action works.
|
|
# TODO: This action only succeeds here because we are forcing
|
|
# grant to accept the ursulas that just came back online (handpicked_ursulas).
|
|
# Since there are now enough Ursulas online, this action *can* succeed without forcing sample.
|
|
policy = alice_grant_action(ursulas=more_nodes[:3])
|
|
|
|
# TODO: This is how it's actually done. How can we measure such random results?
|
|
# The below line will fail with ? probability, if more then 2 of the nodes selected
|
|
# are among those still down.
|
|
# policy = alice_grant_action()
|
|
assert policy.shares == shares
|
|
|
|
|
|
def test_node_has_changed_cert(alice, ursulas):
|
|
alice.known_nodes.current_state._nodes = {}
|
|
alice.network_middleware = NodeIsDownMiddleware(
|
|
eth_provider_uri=MOCK_ETH_PROVIDER_URI
|
|
)
|
|
alice.network_middleware.client.certs_are_broken = True
|
|
|
|
firstula = list(ursulas)[0]
|
|
alice.remember_node(firstula)
|
|
alice.start_learning_loop(now=True)
|
|
alice.learn_from_teacher_node()
|
|
|
|
# Cool - we didn't crash because of SSLError.
|
|
# TODO: Assertions and such.
|