Hacker News Reader

The proofs themselves are far beyond me, but the first page of the Anthropic paper, at least, is much easier for me to follow than the OpenAI one.

I think anthropic one is edited by humans, OpenAI drop just looks like how Astra writes (i know it's probably a different model producing this but still)

The introduction is very nicely written, you're right. I learned a lot from it. There's some detail on how impractical their algorithm is:

> Our result is purely asymptotic: for arbitrary 3-CNF formulas with m = 5n clauses, the bound we prove does not improve on the 2n of exhaustive search unless n > 10^10000,

So their algorithm beats standard algorithms only when you have more variables than there are atoms in the universe (10^80). Even if every atom contained a whole universe, and each atom in each universe itself contained a whole universe, iterated 100 times, your still not there.

Didn't Anthropic also come out with a paper just hours after OpenAI did, a couple weeks ago during that Navier-Stokes thing? Once is coincidence...