Roughtime is a protocol that aims to achieve rough time synchronisation in a secure way that doesn't depend on any particular time server, and in such a way that, if a time server does misbehave, clients end up with cryptographic proof of it.

“Rough” time synchronisation means that, at this stage, we would be happy with time synchronisation to within 10 seconds of the correct time. If you have serious time synchronisation needs you‘ll want the machinery in NTP or even PTP (which needs hardware support to do right). There’s no reason why Roughtime shouldn‘t be (almost) as precise as NTP, but the use cases that we have in mind for now don’t need much precision. For example, about 25% of certificate errors shown by Chrome appear to be caused by bad local clocks and we don't need much precision to fix that.

Found via Cillian O'Driscoll's fork https://github.com/odrisci/roughtime
See also https://github.com/oreparaz/vroughtime for a simple client written in C.

Announced on https://www.rtl-sdr.com

Portable C libraries which provide APIs to build applications with u-blox products and services. Delivered as add-on to existing microcontroller and RTOS SDKs.
Found on https://www.spezial.com/de/node/2052

Software that aims to provide an easy to use (hopefully) universal blackbox for solving polynomials and secular equations.

Among its features you can find:
- Arbitrary precision approximation.
- Guaranteed inclusion radii for the results.
- Exploiting of polynomial structures: it can take advantage of sparsity as well as coefficients in a particular domain (i.e. integers or rationals).

It can be specialized for specific classes of polynomials. As an example, see the roots of the Mandelbrot polynomial of degree 2.097.151 computed in about 10 days on a dual Xeon server.

If you use MPSolve in your research, please cite it as follows:
Bini, Dario A., Fiorentino, Giuseppe, Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numerical Algorithms 23.2-3 (2000): 127-173.
Bini, Dario A., and Robol, Leonardo. Solving secular and polynomial equations: A multiprecision algorithm. Journal of Computational and Applied Mathematics 272 (2014): 276-292.
Found via https://en.m.wikipedia.org/wiki/Aberth_method and https://en.m.wikipedia.org/wiki/MPSolve
See also the GitHub repository http://github.com/robol/MPSolve.git A simpler implementation of the Ehrich-Aberth-method can be found in https://github.com/robol/ea-roots

You supply an antenna and a complex (I/Q) mixer to convert the radio spectrum to a low IF. Then send that IF to your computer using the sound card, Ethernet or USB. The Quisk software will read the I/Q data, tune it, filter it, demodulate it, and send the audio to headphones or speakers. Quisk has a microphone input and a key input so it can operate as a complete transceiver.

Snow is a place to share Scheme programs, libraries and data. Currently we host only R7RS libraries, though we may expand to more dialects in the future.
Found via a link on https://weinholt.se/articles/cond-expand-and-ifdef/
I tried to run the trivial program
 (define ! (n) (if (< n 2) 1 (* n (! (1- n)))))
 (display (! 10))
on http://chibi-scheme.appspot.com/, but got an error message about not being able to enlarge memory arrays.

gVisor is an application kernel, written in Go, that implements a substantial portion of the Linux system call interface. It provides an additional layer of isolation between running applications and the host operating system.
Found on https://marc.info/?l=9fans&m=165401374021100&w=2

List of the ten Finalists of the lightweight crypto standardization process.

Just what it says, links to https://github.com/benr/SunType5_ArduinoAdapter
and
https://github.com/xelalexv/suniversal