Skip to content

Latest commit

 

History

History
18 lines (15 loc) · 556 Bytes

README.md

File metadata and controls

18 lines (15 loc) · 556 Bytes

hRaft

An implementation of Raft in Haskell

This implementaion is based off the original description of the algorithm in the paper "In Search of an Understandable Consensus Algorithm" by Diego Ongaro and John Ousterhout of Stanford University

It is desinged as a state machine that follows through the Raft server states shown in Fig. 4.
Currently the state machine is implicit and mixes pure and impure code, this is a priority to fix

  • Heatbeats
  • Leader Election
  • Follower Failure
  • Leader Failure
  • Writes
  • Reads