dragonboat-example VS memberlist

Yes, "joint consensus" took me a while to comprehend. If you check dragonboat examples there is one ( https://github.com/lni/dragonboat-example/tree/master/ondisk ) which shows how to perform migrations between nodes simply by copying snapshots. There are few open questions (eg. how does it scale up? does it always need to copy everything to target node first or could it be reimplemented with option for streaming?) but it looks quite promising.

I use lightweight https://github.com/hashicorp/memberlist to build initial cluster skeleton (find out what are nodes constituting it)

Does https://github.com/hashicorp/memberlist count? It’s a gossip-based eventual consistency protocol based on SWIM.

An equivalent of golang's memberlist would be awesome.

I don't know the engineer that did it but I know what happened. There's a library that a bunch of foundational Amazon services use called DFDD. It uses a gossip protocol to handle service discovery and health checking. The open source equivalent is Hashicorp memberlist. To remove a node from the cluster, you have to send a command to an arbitrary node that says a node is dead.

serf uses memberlist which uses the SWIM failure detection protocol (https://www.cs.cornell.edu/projects/Quicksilver/public_pdfs/SWIM.pdf) with the Lifeguard extensions (https://arxiv.org/pdf/1707.00788.pdf).

https://github.com/hashicorp/memberlist

Fairly idiomatic/clean

This algorithm assumes you're doing that separately using some sort of membership protocol (e.g. SWIM), and you pass in the membership list that you are keeping up to date with that protocol. If you're curious about those, HashiCorp memberlist and HashiCorp Serf are really good to look at. I believe Consul uses those libraries under the hood.