poanetwork
/
hbbft
mirror of https://github.com/poanetwork/hbbft.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity
hbbft/examples/run-consensus-nodes.sh

14 lines
785 B
Bash
Raw Normal View History

Fix broadcast and example, enable more tests. This fixes several issues with the broadcast algorithm and enables the previously ignored tests that now pass: * Don't decide on a root hash based on anyone's `Echo` message. * Work around the `merkle` crate's inability to produce the proof of the `i`-th leaf for a given index `i`. * Ignore messages from unknown nodes. * Avoid decoding multiple times. * Document the full algorithm. * Don't count multiple `Echo` or `Ready` messages coming from the same node. * Fix index computation for a given proof. * Move `BroadcastMessage` into `broadcast` to make the module more self-contained. The example now only executes a single broadcast instance, expecting the first node (the one with the lexicographically lowest address) to propose a value. A shell script is added that runs for example nodes. Use env_logger instead of simple_logger, so the log level can be controlled with an environment variable. You can e.g. log all output from the broadcast test and the crate itself in debug mode with: RUST_LOG=hbbft=debug,broadcast=debug Some debugging messages are more concise now and use hexadecimal notation instead of printing arrays of decimal values. An indentation error in the Travis script is also fixed.
2018-05-08 07:20:32 -07:00
#! /bin/bash
Improve example logging, add BinaryPath.
2018-05-09 04:38:41 -07:00
export RUST_LOG=hbbft=debug
Fix broadcast and example, enable more tests. This fixes several issues with the broadcast algorithm and enables the previously ignored tests that now pass: * Don't decide on a root hash based on anyone's `Echo` message. * Work around the `merkle` crate's inability to produce the proof of the `i`-th leaf for a given index `i`. * Ignore messages from unknown nodes. * Avoid decoding multiple times. * Document the full algorithm. * Don't count multiple `Echo` or `Ready` messages coming from the same node. * Fix index computation for a given proof. * Move `BroadcastMessage` into `broadcast` to make the module more self-contained. The example now only executes a single broadcast instance, expecting the first node (the one with the lexicographically lowest address) to propose a value. A shell script is added that runs for example nodes. Use env_logger instead of simple_logger, so the log level can be controlled with an environment variable. You can e.g. log all output from the broadcast test and the crate itself in debug mode with: RUST_LOG=hbbft=debug,broadcast=debug Some debugging messages are more concise now and use hexadecimal notation instead of printing arrays of decimal values. An indentation error in the Travis script is also fixed.
2018-05-08 07:20:32 -07:00
cargo build --example consensus-node
cargo run --example consensus-node -- --bind-address=127.0.0.1:5000 --remote-address=127.0.0.1:5001 --remote-address=127.0.0.1:5002 --remote-address=127.0.0.1:5003 --value=Foo &
sleep 1
cargo run --example consensus-node -- --bind-address=127.0.0.1:5001 --remote-address=127.0.0.1:5000 --remote-address=127.0.0.1:5002 --remote-address=127.0.0.1:5003 &
sleep 1
cargo run --example consensus-node -- --bind-address=127.0.0.1:5002 --remote-address=127.0.0.1:5000 --remote-address=127.0.0.1:5001 --remote-address=127.0.0.1:5003 &
sleep 1
cargo run --example consensus-node -- --bind-address=127.0.0.1:5003 --remote-address=127.0.0.1:5000 --remote-address=127.0.0.1:5001 --remote-address=127.0.0.1:5002 &
Improve example logging, add BinaryPath.
2018-05-09 04:38:41 -07:00
wait