HURON
BFT Consensus algorithm for Abassian Shuffle
We use an adaptation of the Hashgraph consensus algorithm, invented by Leemon
Baird. Hashgraph is best described in the
white-paper and its
accompanying document.
Design
While initially it was built for Abassian Shuffle, Huron is designed to integrate with applications written in any programming
language.
Overview
+--------------------------------------+
| APP |
| |
| +-------------+ +------------+ |
| | Service | <-- | State | |
| | | | | |
| +-------------+ +------------+ |
| | ^ |
| | | |
+----------|----------------|----------+
| |
--------- SubmitTx(tx) ---- CommitBlock(Block) ------- JSON-RPC/TCP or in-memory
| |
+-------------|----------------|------------------------------+
| HURON | | |
| v | |
| +----------------------+ |
| | App Proxy | |
| | | |
| +----------------------+ |
| | |
| +-------------------------------------+ |
| | Core | |
| | | |
| | +------------+ | +----------+ |
| | | Hashgraph | +---------+ | | Service | |
| | +------------+ | Store | | -- | | <----> HTTP
| | +------------+ +---------- | | | |
| | | Blockchain | | +----------+ |
| | +------------+ | |
| | | |
| +-------------------------------------+ |
| | |
| +-------------------------------------+ |
| | Transport | |
| | | |
| +-------------------------------------+ |
| ^ |
+---------------------|---------------------------------------+
|
v
P2P Network
USAGE
At the end of the current sprint we are going to release documentation on usage and testing.