The further development of this project is now going on in the repository:
https://github.com/ldmberman/HoneyBadgerBFT
The research and protocols for this algorithm are explained in detail in The Honey Badger of BFT Protocols by Miller et al., 2016.
The implementation is WIP.
Clone the repo, enter the folder, and build the project:
stack setup
./build_dylibs
./build
build_dylibs builds shared libraries required for FFI. Through FFI, we call the threshold_crypto Rust library, which provides threshold encryption functionality.
Run the executable:
stack exec HoneyBadgerBFT-exe
Run tests:
./run_tests
no location info>: error:
Warning: Couldn't figure out LLVM version!
Make sure you have installed LLVM 3.7
ghc: could not execute: opt
Make sure llc and lli are on your PATH. On MacOS, you are likely to find them in /usr/local/opt/llvm\@3.7/lib/llvm-3.7/bin.
- The maximum number of shards supported by the erasure coding scheme library we use is 257. We need to find a way around it to accommodate networks with a much bigger number of validators.