-
A nice compact, readable, sortable unique ID string algorithm, eg. “01BX5ZZKBKACTAV9WEVGEMMVRZ” — 128 bits, 1.21e+24 unique ULIDs per millisecond, case insensitive, with a URL safe character set. Very nice. (via Nelson) There’s a java implementation here: https://github.com/huxi/sulky/tree/master/sulky-ulid
(tags: ulid uuid unique-ids java algorithms via:nelson unique ids)
-
a fascinating alternative numeric representation used during the European Middle Ages
(tags: cistercian numerals writing history middle-ages)