This repository contains multiple prototype implementations of Threshold Logical Clocks (TLC) and Que Sera Consensus (QSC).
-
go/model contains a minimalistic "model" implementation of TLC and QSC in Go, which illustrates the key concepts using goroutines and shared memory communication for simplicity. It is not useful in an actual distributed context, but being less than 250 code lines long as measured by cloc, it is ideal for studying and understanding TLC and QSC. Playing with or porting this model implementation to some other language may be a good way to get a handle on the fundamentals.
-
go/dist contains a simple but functional "real" distributed implementation of TLC and QSC for a fail-stop (Paxos-like) threat model. It uses TCP, TLS encryption and authentication, and Go's native Gob encoding for inter-node communication. At less than 1000 code lines long as measured by cloc, it is still probably one of the simplest implementations of asynchronous consensus around.
-
spin contains a simple Promela model of the core of TLC and QSC for the Spin model checker. Although this implementation models TLC and QSC only at a very high, abstract level, it captures the basic logic enough to lend confidence to the correctness of the algorithm.
All of this code is still extremely early and experimental; use at your own risk.