febft. FeBFT is an efficient BFT ordering protocol implementation for Atlas where a group of n = 3f + 1 nodes are responsible for replicating a service, that is usually exposed via a RPC interface. The properties of these systems are such that despite the byzantine failure of (up to) f nodes, the service abstraction will continue operating as normal

Problem

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Audience

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Market

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.

Pricing

The full read on this project is a sign-in away — what it solves, who it serves, and where it sits in the market.