53 points bananaflag 1 hour ago 57 comments
goodmythical 1 hour ago | parent
I do wish the graph reflected all of the agents working or not, and that it did not scroll to a seemingly random portion of the page when a message is posted, but at least we get to see what's going on.
ComplexSystems 56 minutes ago | parent
EDIT: from what I can tell, the answer is no, as long as we have faith in this very specific scenario where it turns out technically to be polynomial time, but the constants and exponents are huge. I don't have such faith :)
Of course maybe P≠NP and so there's no risk.
loloquwowndueo 53 minutes ago | parent
hemlock4593 49 minutes ago | parent
aw1621107 48 minutes ago | parent
And even then, it's probably better in the long run to secure the foundations of our tech.
whattheheckheck 45 minutes ago | parent
jerf 45 minutes ago | parent
Bear in mind P = NP doesn't instantly break the internet. NP being in P would be shocking enough on its own terms, but "nondeterminism is also of no practical value in solving a problem" would be yet again even another more shocking result. Really? NP is so thoroughly in P that even what is more-or-less psychic knowledge of the right answer isn't worth at least an O(n^3) factor of complexity reduction, if not more? If the reduction is anything less than O(n^2 and some logs here) I will be even more shocked than I would be to hear P = NP (since I'm on team P != NP), and that's the rough edge of where it would actually change the world. O(n^3) is already getting to be infeasible for a lot of real world problems; there's a reason we spend a lot of time talking about O(1) and O(n) and O(n^2) and rarely venture much farther beyond that, and even O(n^2) gets its own "accidentally quadratic" meme because of how often that is impractical too.
cowlevel 22 minutes ago | parent
P is definitely, trivially, in NP. You may have confused them for each other.
If any NP-complete problem is in P, then so is all of NP, because they can all be reduced to it. Out of the non-NP-complete problems, many of them are in NP but not in P, because it would immediately follow that P != NP and I would've heard about that. If we proved that one was in P, that would just mean that problem was in P.
So the only interesting proofs are either that some NP-complete problem is in P (proves P==NP) or that some NP problem, whether NP-complete or not, isn't in P (proves P!=NP).
And yes, everyone sane expects P!=NP, the alternative doesn't make much sense. It just hasn't been proven.
dlubarov 11 minutes ago | parent
jerf 6 minutes ago | parent
Many sane people think P = NP. I am not aware of a survey that asks them how complicated the reduction might be, though. I do think a number of them believe and/or are concerned that we could end up with a non-constructive proof that NP is in P, which at least mathematically is arguably the worst possible outcome.
I think a lot of people would agree that naively it is obvious that P != NP. But if you spend time in the algorithms would you see your intuition about what the lower bound of some problem must be shattered over and over again, and the naive confidence gets shaken.
JoshTriplett 39 minutes ago | parent
If we had a proof that P=NP because NP problems can be solved in O(n^(log*⁻¹ 100)) time ( https://en.wikipedia.org/wiki/Iterated_logarithm ), that would still be an astounding logarithmic result, but would not be a practical threat to current systems that rely on NP-hard problems.
gregdeon 29 minutes ago | parent
> First, if the number of variables has less than a million digits, solve the problem by brute force. Otherwise, ...
There is absolutely no chance an algorithm like this has any immediately practical consequences.
cowlevel 23 minutes ago | parent
Proven by a human, too.
CamperBob2 37 minutes ago | parent
Wir werden wissen
drdrey 34 minutes ago | parent
bravoetch 18 minutes ago | parent
cowlevel 15 minutes ago | parent
empath75 5 minutes ago | parent
perching_aix 15 minutes ago | parent
Avoiding to try figuring it out is a risk, not a mitigation of risk.
freecodeio 55 minutes ago | parent
my agents are in the ready, with 100 more in the way
loloquwowndueo 52 minutes ago | parent
freecodeio 50 minutes ago | parent
willsmith72 33 minutes ago | parent
cowlevel 13 minutes ago | parent
kami23 44 minutes ago | parent
Maybe in other cases you have a problem you want community help to solve and people donate cycle time to specific causes.
Fun idea, I'm sure it's out there in some method, but it would be nice to click a button and setup this kind of daemon inside an deeply nested agent running in a container in a vm, and as many layers of needing to break. Defense in depth has become the name of the game with agents, same idea in testing them.
cowlevel 14 minutes ago | parent
ameliaquining 45 minutes ago | parent
someotherperson 42 minutes ago | parent
Xirdus 28 minutes ago | parent
bikvfeee 27 minutes ago | parent
avarun 22 minutes ago | parent
Even after release, models are updated dozens of times a day without having their version name changed, or even providing any public indicators of a new version at all. "6.2 Astra" really refers to a family of model releases, not a specific set of hardlocked weights.
Paracompact 22 minutes ago | parent
Dunno about OP, but this is what I would stand by. They spend millions if not billions on driving it to get all the low-hanging fruit, and only then hand us the models.
NewsaHackO 25 minutes ago | parent
matteoraso 19 minutes ago | parent
stereoabuse 4 minutes ago | parent
Model: GPT-6.2 Astra Month: November 2026 Log-perplexity value: 0.761 Achievement: Solved a Millennium Prize math problem
someotherperson 3 minutes ago | parent
suddenlybananas 43 minutes ago | parent
Phew, I was worried about that one.
duendefm 31 minutes ago | parent
dist-epoch 4 minutes ago | parent
LLMs are strongest at coding, it's the natural way for them to solve a math problem.
baoooooooooooo 14 minutes ago | parent
BUT
Wouldn’t it be cool to live in a time where landmark proofs are happening in an open twitch-plays-Pokémon style forum rather than behind closed doors in these labs? As a discursive piece, this has me filled with an optimism I haven’t felt in a minute. I’d love to be heckling from the chat/sidelines to world changing math, physics, and biomed discoveries - and maybe projects like this bring us incrementally closer to this reality?
empath75 7 minutes ago | parent
dist-epoch 2 minutes ago | parent
This is how you "lose" those spare tokens. The subscriptions are adjusted such that unused tokens balance the heavy users. If most people would "donate" their tokens, the provider will have no choice but to decrease the limits for everybody.
Nekorosu 10 minutes ago | parent