Paxos made simple

To run, first setup the environment by running nix develop in the root of the repository, or allow direnv to do it automatically if you have it installed in your machine.

Now cd into /paxos and run cargo run. You can use the arguments --nodes and rounds to specify a custom number of nodes and rounds for the simulation. Run --help to see the available commands.

Architecture

This is a kind of simplified version of Paxos, so for now it does not support multiple proposers and learners. It also implies that the algorithm will halt if there's no proposer os learner (which is, if their nodes die in the process).

In this implementation, the proposer performs the roles of both the proposer and learner, being the "leader" of the round, as stated in the "Paxos made simple" paper:

The algorithm chooses a leader, which plays the roles of the distinguished proposer and the distinguished learner.

sequenceDiagram
    participant Proposer
    participant Acceptor
    participant Learner

    Proposer->>Acceptor: Prepare(n)
    Acceptor-->>Proposer: Promise(n, v) (highest seen n and value)
    Proposer->>Acceptor: Accept(n, v) (proposed value)
    Acceptor-->>Proposer: Accepted(n, v)
    Acceptor-->>Learner: Learn(v) (accepted value)
    Learner-->>Proposer: Acknowledged

Loading

TODO

• auto format on pre-commit
• set up sqlite database
• handle Lagged error in broadcast. Congestion window?
• store node ids (in case some node dies, etc)
• decouple code
• allow more learners
• allow more proposers
• remove expects and unwraps and improve code in general
• use a generic interface to allow nodes to rotate positions, so that for each "round" nodes can be assigned different roles instead of fixed acceptors and proposers. Idk about learners
• distributed fibonacci