shorden

40 ms·

1.
by shorden 4mo ago
Interesting, I haven't tested this myself but intuitively I think that a 4 byte OOB write is plenty for a data-only attack like [PageJack]( https://i.blackhat.com/BH-US-24/Presentations/US24-Qian-Page... ), so
2.
Impressive Claude Code Features(glitch.land)
3 points by shorden 6mo ago|0 comments
3.
by shorden 6mo ago
Worth noting that this is a bound on arbitrary search, but there exist some problems with structure (e.g. integer factorization) for which quantum algorithms are exponentially faster than known classical algorithms (a problem believed to be
4.
by shorden 7mo ago
Repost of https://news.ycombinator.com/item?id=47088212 due to the page changing its title
5.
by shorden 8mo ago
nethack.alt.org is conspicuously absent...
6.
by shorden 8mo ago
Also worth noting that the verifier is under active development not only to verify more legitimate programs, but also to reject programs with exploits and side channels (and there are runtime defenses too, like dead code elimination and ALU
7.
by shorden 10mo ago
I worked a tiny bit on this experiment so I'm a bit biased, but it really is quite an impressive demonstration. I don't know if the methodology has changed since I was on the project, but in the past there was a whole process of s
8.
by shorden 10mo ago
The discussion of Richard Caley was warming, reminded me of Izchak Miller a little bit.
9.
by shorden 11mo ago
For a blend between Lisp and a more traditional POSIX shell, I enjoy Emacs' [eshell]( https://www.masteringemacs.org/article/complete-guide-master... ).
10.
A brief history of Apple content caching services(eclecticlight.co)
2 points by shorden 1y ago|0 comments
11.
How to check if your Apple Silicon Mac is booting securely(eclecticlight.co)
101 points by shorden 1y ago|22 comments
12.
by shorden 1y ago
That's an excellent question, I thought the exact same thing when I wrote this article. From what I can tell [child]( https://github.com/NetHack/NetHack/blob/ed600d9f0f3c37677418... ) properly spawns a chi