This is interesting. In my blogposts analyzing ATproto I had compared the shared heap vs message passing from a CS perspective

https://dustycloud.org/blog/how-decentralized-is-bluesky/
https://dustycloud.org/blog/re-re-bluesky-decentralization/

Ian Preston of Peergos did the actual formal mathematical proof of the incentive structure: https://peergos.net/secret/z59vuwzfFDp45jmsA6Wj2jc9hemCjB4JJHB81iosJsA9GAVRtkbrqBs/1024927538#%7B%22app%22:%22markup%22%2c%22path%22:%22ianopolous/docs%22%2c%22args%22:%7B%22filename%22:%22social-scaling.note%22%7D%2c%22writable%22:false%2c%22secretLink%22:true%2c%22linkpassword%22:%22UfAQURKSTTmM%22%2c%22open%22:true%7D

> It is interesting that this is independent of N. Let's say you have 1000 servers, and 1000 followers per user. Then the shared heap model uses about the same network bandwidth. With a small number of servers SH can be better, with many servers AP is better.

> The conclusion is that the shared-heap model builds in a structural incentive to keep M small, and thus has a natural centralizing force. Conversely there is an incentive in AP to keep F small.

Ie, there is a mathematical incentive in ATproto to only have a few large players.

Google used a ZK proof to disclose a quantum breakthrough that cuts the cost of breaking cryptocurrency by 20x without handing attackers the circuit.

The Rust code behind the proof had memory safety bugs. We used this new attack surface to forge a proof that beats Google’s on every metric.

Google patched it within days. Their quantum claims are unaffected. https://blog.trailofbits.com/2026/04/17/we-beat-googles-zero-knowledge-proof-of-quantum-cryptanalysis/

RE: https://ec.social-network.europa.eu/@EUCommission/116408720976324749

Doesn't work without a Google/Apple-tied device btw. There is absolutely no story for how this would work on a desktop, anything without a Google/Apple account, or open source OS at all either.

I'm #colorblind and I use https://xkcd.com/color/rgb/ frequently.

Randall 'xkcd' Monroe did a survey of over 100,000 readers where he showed them random rgb colors and said "what would you call this?" and afterwards he did his best to sort the results into the most popular color names and the colors they refer to.

It's like a box of Crayola for the internet. Finally, my colorblind self can grab a sample of "dark magenta" that doesn't just look like "grape purple" to everyone else.

The data is freely available as a .txt file under CC0, which I've converted into a .css file here: https://git.hatspace.net/nycki/nycki.net/src/branch/main/static/xkcd.css

so now when I want a color on my website I can just write `color: var(--xkcd-off-white)` or so on. it's really convenient :)

edit: blog post discussing this data in more detail: https://blog.xkcd.com/2010/05/03/color-survey-results/

#programming #color #css #website