Recent submissions

Comment · 2 days ago
But isn't one problem here that it's not just personal consumption? People bemoan the proliferation of food-service (Sysco et al) "slop" at restaurants. It seems like LLM writing for others is serving that $3 burrito for $15 without even trying to doctor it up. If you're not willing to put in the effort to think about and produce your writing it's probably best to keep it for personal consumption.
Comment · 4 days ago
If you look through Ryan Williams' x thread he links to a google drive folder (https://drive.google.com/drive/folders/1SAqEO1kt6wnA0NXuZecy...) with the OpenAI and Anthropic papers. There is also a new human contribution which is pretty accessible from Amit Sahai. I found this paper to be a more reasonable read, although the author(s) do state that their goal is to demonstrate a subexponential bound via an easier to follow approach.

Maybe it's a bit early to predict here but it feels like this approach might have a series of improvements similar to the progress made on the faster FFT multiplcation result.

Comment · 4 days ago
2^(n/logn) will eventually be smaller than (1+epsilon)^n for any fixed positive epsilon. However, as log(n) grows quite slowly n will have to be exceptionally large. For epsilon=2^-D n will have to be something like 2^(2^D) large.
Comment · 6 months ago
It appears so!
Comment · 1 year ago
I don't want to ruin the game for the community so will hold off on saying too much. I will say this- this game is very well designed so it's pretty straightforward to understand how it works without using anything more than the network tab of chrome :). No js, frontend puppeteering, etc. are needed. I might write it up when the game is close to completion!
Comment · 1 year ago
Comment · 1 year ago

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton