God give me patience, because if you give me strength I'm going to need bail money.

How to get away with mass murder: 4 tactics Ethiopia used to hide Tigray atrocities from the world
https://blknewsnow.com/how-to-get-away-with-mass-murder-4-tactics-ethiopia-used-to-hide-tigray-atrocities-from-the-world/

Redlining links Black women and higher rates of breast cancer
https://blknewsnow.com/redlining-links-black-women-and-higher-rates-of-breast-cancer/

What 1.4M emails reveal about America's most notorious sex offender

https://www.economist.com/interactive/international/2026/02/12/inside-epsteins-network

#HackerNews

@negschaumburg1 nope, keine Alternative aufgrund des Angebots

California launches civil rights investigation into Eaton Fire response in Altadena
https://blknewsnow.com/california-launches-civil-rights-investigation-into-eaton-fire-response-in-altadena/

How the NAACP Signed Up to Abolish ICE

https://www.motherjones.com/politics/2026/02/naacp-derrick-johnson-abolish-ice-campaign/

Trump’s war on civil rights has pushed the group—117 years old today—into a new era of confrontation.

My hypothesis: if you’re better than average, you’re better than the bot and can therefore see its shortcomings. If you’re not, you experience Dunning-Kruger. If you’re a lot worse than the bot, it probably feels like magic.

This would also explain how people who are experts in a field tend to think AI can’t replace their field even when they think it’ll replace other fields.

One of the interns decided to interview devs across my org about how/whether they use AI for development and what they think about it. They shared without names but with titles.

I noticed that the more senior a dev is, the more they’re likely to have low opinion of AI and/or only use it for very narrow purposes. More junior devs tend to say things like “it makes me a better dev”

@jamie I *am* an IP lawyer and I (along with many others) have been saying it for a while, that if the position the “AI” co’s are taking with respect to the legality of scraping “publicly available” materials were true (that all “publicly available” materials are “public domain” free to be used as raw materials without consent required), then copyright ceases to exist and all their own materials will be free for everyone else to use the very first time they’re leaked. That’ll be fun for the co.

The Tangled Bank Job

#DarwinianShowsAndPlays
#HashTagGames

@liaizon All the 3D!

@SummerOf68 tatsaechlich bin ich Pro Ruestungs Investments angesichts der aktuellen Lage. Haetten wir das in Europa frueher gemacht, haetten wir die Ukraine besser unterstuetzen koennen

Kenne die ganzen Umzugservices... Leider vom Angebot, vor allen Dingen in Nischen Genres nicht vergleichbar

Ich bleibe bei Spotify, wie auch bei Google Maps

@bencourtice @xyla @rail “Or” implies “and/or.” They didn’t use “xor,” which means one or the other, but not both. 😉

@quillmatiq I can't seem to find any API docs for this?

Over the past couple days I broke complex-number arithmetic, & in turn trigonometry, down into floating point multiply-adders. So how'd I design such a multiply-adder?

IEEE 754 suggests encoding real numbers as a 1bit sign, 8bit exponent, & 23bit fraction. With an implicitly preceding "1." on the fraction. IEEE 754 suggests adding 127 offset to the exponent, but it may save circuitry if we instead encode it internally as 2's complement.

Makes multiply easy!

1/3?

To multiply 2 single-precision floating points we XOR the signs, add the exponents, & multiply the fractions adding a leading 1. And if the multiply overflows, increment exponent & shift the fraction.

Except to get more range in this encoding... Don't add that implicit leading 1 on the fraction upon minimum exponent! And to encode errors or infinities... Disable the circuit if the exponent's at its maximum.

As for addition/subtraction... We 1st subtract/compare the exponents.

2/3?

This comparison lets us choose which exponent to keep & which operand gets bitshifted. With the appropriate operands shifted, negated, & implicit leading 1 (if any) implied it adds them.

Upon overflow it increments the exponent & bitshifts the fraction, before checking if the fraction has leading zeroes to bitshift away adjusting the exponent to match. Counting those leading zeroes is a simple combinatorial circuit.

Merging these multiply & add/subtract circuits parallelizes cleanly!

3/3.5!

Finally I'll remark: I've already designed circuitry to handle the underlying integral arithmetic, & have done so recently in the context of my last microcontroller. So I won't revisit it again.

What I will do is look at the FFT pseudocode again, & take another look at how I'd implement it in microcode. Alongside what additional microcode I'd need!

3.5/3.5 Fin for today!