Go to file
Vladimir Komendantskiy e9808efc61 the set of node indices of common coin shares is now computed only once 2018-06-13 22:05:11 +01:00
examples the set of node indices of common coin shares is now computed only once 2018-06-13 22:05:11 +01:00
proto protobuf serialization 2018-06-13 15:17:11 +01:00
src the set of node indices of common coin shares is now computed only once 2018-06-13 22:05:11 +01:00
tests note in the broadcast example about the use of keys 2018-06-13 18:24:35 +01:00
.gitignore Merge branch 'master' into remove-autogenerated-message.rs 2018-03-28 14:52:13 +01:00
.travis.yml optimised tests to execute faster - needed by pairing computations 2018-06-13 15:18:27 +01:00
Cargo.toml Implement polynomials for distributed key generation. 2018-06-11 16:45:08 +02:00
LICENSE added GNU license and removed obsolete comments 2018-04-01 21:41:49 +01:00
README.md Add bandwidth and CPU to the simulation. 2018-05-31 14:28:10 +02:00
TODO added a TODO file and changed indentation in the .proto file 2018-05-10 10:02:03 +01:00
build.rs Remove protoc dep, use new MerkleTree methods. 2018-05-17 16:50:47 +02:00

README.md

Build Status Gitter

About

An implementation of the paper "Honey Badger of BFT Protocols" in Rust. This is a modular library of consensus. There are examples illustrating the use of this algorithm.

This is work in progress. Parts of the algorithm are still missing or incomplete.

An example is included to run a simulation of a network:

$ cargo run --example simulation --features=serialization-serde -- -h

Building

You can build hbbft using cargo:

$ cargo build [--release]