Recently I stumpled upon two interesting projects that I thought was worth sharing.
The first is Reticulum, an encrypted network that allows one two create adhoc private mesh networks over both internet and wireless links.
The second is the Eg-walker paper detailing an efficient crdt algorithm for text. What I found interesting is that some of the algorithms seems more general and this might be applicable in other situations with concurrency. The paper also details a lot of tricks used to spead an the implementation. The paper is based on diamond types, so more a write up of an existing system rather than a new algorithm that is not really used anywhere yet.