Zach "earboxer" DeCook @zachdecook@librem.one

I want to fill out my aggregated gemlog subscription page some more. I add one here and there as I discover good ones but if you have a gemlog that you post to regularly or would like to suggest any that you really like I'll take em!

The dollar is suddenly worth 0, all the stores are boarded up.

We need to talk about matrix.org

https://wordsmith.social/yyp/about-matrix-dot-org

This is 002 of #100DaysToOffload

#matrix #decentralization #privacy

Added the option to see each 1-bit channels per line, and the assembled 4-colors result.

Added some features I liked from Acme, right-click to find the next instance for a word.

@zachdecook @akkartik I use a mouse and it feels pretty great :D

PHP8 is a thing

Own up who let the PHP team see Rust and TypeScript? You know what they are like

@sir see ya on :1965

@sir At least to some degree (I think) this is explained here https://www.raptitude.com/2010/07/your-lifestyle-has-already-been-designed/

Related: I don't trick Vim out to be an IDE-alike, and neither should you. I use mostly vanilla Vim:

https://git.sr.ht/~sircmpwn/dotfiles/tree/master/.vimrc

I use a second terminal and shell commands to do various tasks I might ask of an IDE, such as building the software, finding compile errors, bulk find or bulk replace, using tools like grep, sed, awk, make, etc. This approach is very flexible - almost any task can performed and almost any question answered without having to use rails laid down by IDE designers - but also practical, because they can be turned into re-usable scripts.

Good reference if you lack shell proficiency:

http://shellhaters.org/

@purism I was unable to find the place where you explain how that funding will be used (allocating internal developer time to work on the apps, paying upstream developers…). Can you point me to that page?

:drakeDislike: binary
:drakeLike: negabinary

If you don't know what negabinary is, it's base -2

In maths, when you have a base, you multiply each digit by the base power the position before summing them up

For instance in decimal (base 10), 367 = 7 * 10^0 + 6 * 10^1 + 3 * 10^2 = 7 * 1 + 6 * 10 + 3 * 100

In binary (base 2), 101 = 1 * 2^0 + 0 * 2^1 + 1 * 2^2 = 1 * 1 + 0 * 2 + 1 * 4 = 5

In negabinary, it's interesting, you get 110 = 0 * (-2)^0 + 1 * (-2)^1 + 1 * (-2)^2 = 0 * 1 + 1 * (-2) + 1 * 4 = 2

What's interesting in negabinary is that it achieves a similar result to balanced trinary, which is getting every natural number from -infinity to +infinity without using a bit for the sign. But it achieves it using 2 states, which is easier to have with current technology (transistors only make 2 states, and technologies that make 3 states are much more expensive)