I’ve never used Discord – is it similar to Mumble? I tried Jami but found it too unreliable to recommend. What about Nextcloud Chat? I do use that though it is kind of clumsy.

https://ifanyonebuildsit.com/ argues the opposite (“if anyone builds it, everyone dies”). It’s not out yet though.

If you mean those find-me gizmos, they are bluetooth, not NFC.

Too janky, too much JS crap on the website, appears to be closed source, no obvious self hosting option, meh. No I couldn’t imagine using or recommending it. Sorry.

Don’t ever write any really private data to the SSD in cleartext. Use an encrypted file system. “Erase” by throwing away the key. That said, for modern fast SSD’s the performance overhead of the encryption might be a problem. For the old SATA SSD in my laptop, I don’t notice it.

“Why are we running from the police, Daddy?”

“Because we use Emacs, son. They use vim.”

–old Slashdot T-shirt

Cool, yeah, the digits themselves are at most 0.5 byte each ;). I don’t know enough about the higher level algorithm to say exactly how the rest of the storage is being used. There is a book called “Pi and the AGM” about pi computation and similar algorithms that is supposed to be really good, but it looks over my head mathematically.

Yes, that’s the idea, it’s just that the “spoiler” likely only revealed something that was already known (that specific digit), or at any rate, something that could be computed on a much smaller computer and in less time. Mostly though, that’s a bit of mathematically interesting info.

I don’t feel like watching a video but maybe there will be a more informative article sometime. I wonder if they used some existing software like Y-cruncher: https://en.wikipedia.org/wiki/Y-cruncher

Says they used a cluster with 2.2PB of flash drives (that was Kioxia’s contribution) and the calculation took 7.5 months. Article is otherwise sort of useless. I’d like to know more technical and mathematical details. It gives the “spoiler” that the 300 trillionth digit of pi is 5, but that was already relatively easy to compute using the Borwein-Bailey-Plouffe algorithm and was probably already known. The BBP algorithm lets you compute a specific digit like the 300 trillionth, using fairly little memory and much less compute time than computing all of the digits.

https://en.wikipedia.org/wiki/Bailey–Borwein–Plouffe_formula

Well ackshually…