hbbft/tests
Andreas Fackler d52be00d0e Fix CI.
Fix a few new Clippy lints, and some broken dependencies.
2020-03-20 10:37:31 +01:00
..
README.md Fix unused error in test and fix markdown format error 2019-07-24 15:39:58 +02:00
binary_agreement.rs Update to Rust 1.35.0. 2019-06-18 16:31:17 +02:00
binary_agreement_mitm.rs Fix unused error in test and fix markdown format error 2019-07-24 15:39:58 +02:00
broadcast.rs Fix CI. 2020-03-20 10:37:31 +01:00
dynamic_honey_badger.rs fix some clippy warnings 2019-11-12 11:12:47 +01:00
honey_badger.rs Change the `Target` variants. 2019-07-29 12:08:54 +02:00
queueing_honey_badger.rs Fix CI. 2020-03-20 10:37:31 +01:00
subset.rs Fix CI. 2020-03-20 10:37:31 +01:00
sync_key_gen.rs Remove non-threshold keys from NetworkInfo. 2019-08-27 20:51:24 +02:00
threshold_sign.rs Fix CI. 2020-03-20 10:37:31 +01:00

README.md

Honey Badger tests

The hbbft crate comes with a toolkit for testing its various algorithms in simulated network environments.

Old vs new

The old testing code can be found inside the network module and .rs files in the tests subdirectory that are not prefixed with net_. The newer networking code is contained inside the net module and the remaining .rs files.

The new implementation offers many advantages, such as better abstractions for adversaries, easier implementations influencing the message delivery order, better reporting of failed tests, packet recording and more convenience functions. The old tests continue to work, but will be migrated step-by-step to take advantage of the newer features.

VirtualNet

Core of most tests is the net::VirtualNet struct, which simulates a network of nodes all running an instance of a consensus protocol. Messages sent by these nodes are queued by the network and dispatched each time the network is advancing one iteration, commonly referred to as being "cranked". Each time the network is cranked, a buffered message is delivered to its destination node and processed.

Virtual networks can also host an adversary that can affect faulty nodes (which are tracked automatically) or reorder queued messages.

Use the NetBuilder to create a new network:

// Create a network of 10 nodes, out of which 3 are faulty.
let mut net = NetBuilder::new(0..10)
    .num_faulty(3)
    .using(move |node| { DynamicHoneyBadger::builder().build(node.netinfo) })
    .build()
    .expect("could not construct test network");

Algorithms that return a Step upon construction should use using_step instead.

Sending input

Send Input to any VirtualNet node using the send_input method:

let input = ...;
let _step = net.send_input(123, input).expect("algorithm failed");

While the resulting step is returned, it needn't be processed to keep the network going, as its messages are automatically added to the queue.

Instead of targeting a node in particular, the same input can be sent to all nodes:

net.broadcast_input(input).expect("algorithm failed");

Cranking the network

The network advances through the crank() function, on every call

  1. the adversary is given a chance to re-order1 the message queue,
  2. the next message in the queue is delivered to its destination node (if the node is non-faulty) or the adversary (if the node is faulty),
  3. all messages from the resulting step are queued,
  4. and the resulting step (or error) is returned.

If there were no messages to begin with, None is returned instead.

1: Due to some implementation deficiencies it is possible for an adversary to mutate any part of VirtualNet (i.e. to change things beyond the scope of our adversary model). While this will be addressed in future versions, it is currently up to the test implementor to ensure that adversaries are not more powerful than they are supposed to be.

Cranking can be done manually:

let step = net.crank()
              .expect("expected at least one messages")
              .expect("algorithm error");

// Shorthand:
let step = net.crank_expect();

For convenience, an iterator interface is also available:

for res in net {
    let (node_id, step) = res.expect("algorithm error");
    // ...
}

This has the drawback that access to the network is not available inside the loop, as it is borrowed. A common workaround is using a while loop instead:

while let Some(res) = net.crank() {
    let (node_id, step) = res.expect("algorithm error");
    // `net` can still be mutably borrowed here.
}

Inspecting the network

In addition to the returned Steps, the network and nodes can be queried through various methods: VirtualNet::{nodes, faulty_nodes, correct_nodes, get, get_mut}.

Adversaries

Adversaries can be introduced through the .adversary method on the constructor and are expected to implement the net::adversary::Adversary trait. Generic adversaries are available in the same module, while algorithm-specific ones should live next to each test case.

// Missing example.

Tracing

By default, all network tests write traces of every network message into logfiles, named net-trace_*.txt in the current working directory. Each log stores one message per line, in the format of [SENDER] -> [RECEIVER]: MSG.

This behavior can be controlled using the HBBFT_TEST_TRACE environment variable; if set and equal to 1 or true, this functionality is enabled. Tracing is disabled by default.

The NetBuilder allows hard-coding the trace setting, any value passed will override environment settings:

let net = NetBuilder(0..10)
  .trace(false)   // Never log network messages.
  // ...

Checking outputs

As a convenience, all nodes capture any generated output during operation for inspection. The following code fragment demonstrates how to verify that all non-faulty nodes have output the same thing:

let first = net.correct_nodes().nth(0).unwrap().outputs();
assert!(net.nodes().all(|node| node.outputs() == first));

println!("End result: {:?}", first);

Time-limits

Every VirtualNet instance limits execution time to 20 minutes by default, this can be adjusted using the time_limit function:

use std::time;

let num_nodes = 10;
let mut net = NetBuilder::new(0..num_nodes)
    // Change the time limit to five minutes per node total.
    .time_limit(time::Duration::from_secs(num_nodes * 5 * 60))

If the time limit has been reached, crank will return a TimeLimitHit error. The time-limit can be disabled completely through no_time_limit().

It's also possible to run tests without a time-limit on a per-run basis by setting the HBBFT_NO_TIME_LIMIT environment variable to "true".

Randomness

The test framework supports deterministic randomness by allowing all random values to be dervied from a single random generator. By seeding this generator with a fixed value, tests can be reproduced precisely:

#[test]
fn do_example_test(seed: TestRngSeed, dimension: NetworkDimension) {
    // Instantiates a new random number generator for the test.
    let mut rng: TestRng = TestRng::from_seed(cfg.seed);

    let mut net = NetBuilder::new(0..dimension.size())
        .num_faulty(cfg.dimension.faulty())
        // Setting `rng` ensures that randomness will only be retrieved by
        // `VirtualNet` from the `TestRng` instantiated above.
        .rng(rng)
        .using_step(move |node: NewNodeInfo<_>| {
            DynamicHoneyBadger::builder()
                // `DynamicHoneyBadger` can also be configured with a random
                // number generator. `NewNodeInfo` includes a convenience
                // field that contains a ready-to-use random number generator:
                .rng(node.rng)
                // ...
        })
        // ...
}

Property based testing

Many higher-level tests allow for a variety of different input parameters like the number of nodes in a network or the amount of faulty ones among them. Other possible parameters include transaction, batch or contribution sizes. To test a variety of randomized combinations of these, the proptest crate should be used.

The first step in using proptest is parametrizing a test, ensuring that all parameters are passed in and not hardcoded. The resulting function should be wrapped, due to the fact that rustfmt will not reformat code inside most macros:

proptest! {
  #[test]
  fn basic_operations(num_nodes in 3..10u32, num_tx in 40..60u32) {
      do_basic_operations(num_nodes, num_txs);
  }
}

fn do_basic_operations(num_nodes: u32, num_txs: u32) {
    // ...
}

Some helper structures and functions are available, e.g. the number of nodes should rarely be specified using a range, but with the NetworkDimension strategy instead:

use net::NetBuilder;
use net::proptest::NetworkDimension;

proptest! {
    #[test]
    fn basic_operations(dimension in NetworkDimension::range(3, 10), num_txs in 40..60u32) {
        do_basic_operations(dimension, num_txs)
    }
}

fn do_basic_operations(dimension: NetworkDimension, num_txs: u32) {
    let mut net = NetBuilder::new(0..cfg.dimension.size())
        .num_faulty(cfg.dimension.faulty())
        // ...
}

When specified this way, dimension will always be generated with a random valid number of faulty nodes, which is limited by the total amount of nodes. Additionally, proptest will automatically try to shrink the solution to a minimum if an error is found. The NetworkDimension is reduced in a way that tries to find a minimal combination of size and faulty nodes quicker than independently modified node counts would.

To cut down on the number of parameters passed to each function, a struct containing all parameters for a single test can be added for larger parameter sets:

prop_compose! {
    /// Strategy to generate a test configuration.
    fn arb_config()
                 (dimension in NetworkDimension::range(3, 15),
                  total_txs in 20..60usize,
                  batch_size in 10..20usize,
                  contribution_size in 1..10usize)
                 -> TestConfig {
        TestConfig{
            dimension, total_txs, batch_size, contribution_size,
        }
    }
}

proptest!{
    #[test]
    fn drop_and_readd(cfg in arb_config()) {
        do_drop_and_readd(cfg)
    }

    // ...
}