Babble – Byzantine fault-tolerant consensus for distributed applications

Exciting new use of the Hashgraph Technology…


A pluggable software component that brings Byzantine fault-tolerant consensus to distributed applications. It is driven by a powerful algorithm which does away with the network overhead of other consensus systems.

Babble uses the Hashgraph consensus algorithm which offers definitive advantages over other BFT consensus systems.

It is based on the intuitive idea that gossiping about gossip itself yields enough information to compute a consensus ordering of events. Communication between nodes is kept to a minimum and all the hard work is done internally by the program. This makes Babble particularly resilient to network failures and capable to process thousands of transactions per second with sub-second latencies.

Leave a Reply

Your email address will not be published. Required fields are marked *