Hacker News

Top stories

Live mirror
30 storiesupdated just nowView source snapshot
  1. GPT-6 Sol and Luna(openai.com)
    442comments
  2. Claude Opus 5.5(anthropic.com)
    673comments
  3. 'We hacked the FBI:' Hackers say they have data on all FBI employees(404media.co)
    77comments
  4. OpenAI GPT–6 Astra breaks Enigma message that has resisted solution since 2005(cryptocellar.org)
    342comments
  5. No Sloptober(no-sloptober.com)
    discuss
  6. SAML: A Fractal of Bad Design(trailofbits.com)
    32comments
  7. Claude Opus 5.5 Intelligence, Performance and Price Analysis (Max)(artificialanalysis.ai)
    51comments
  8. WordPress: Unauthenticated path traversal leading to conditional RCE(github.com/wordpress)
    59comments
  9. What California is learning from solar panels built over irrigation canals(kqed.org)
    24comments
  10. Native apps written in TypeScript and CSS(github.com/geastack)
    8comments
  11. Unreal Agent(unreallabs.ai)
    43comments
  12. Markdown in /src(htmx.org)
    16comments
  13. OpenAI is well positioned to fast-follow Jev(arcturus-labs.com)
    169comments
  14. An update on how we confirm your age group on Discord(discord.com)
    9comments
  15. Show HN: Training a model to identify AI web content from structure alone(arxiv.org)
    5comments
  16. Did OpenAI solve the wrong Navier-Stokes problem?(scientificamerican.com)
    20comments
  17. MUNI Heritage Weekend in San Francisco(lawrence.lu)
    32comments
  18. Rabbit Hole: Minimum L-seams(fractalkitty.com)
    5comments
  19. How did AMD Ryzen get 50% faster in two years?(lemire.me)
    27comments
  20. Show HN: JevBench, a reproducible benchmark for typed decision models(benchmarkheaven.com)
    1comments
  21. A Faster Shortest Path Algorithm(vals.ai)
    5comments
  22. 16-bit Intel 8088 chip (c. 1985)(allpoetry.com)
    12comments
  23. George Lucas Returns to Earth, Bearing Gifts(commonedge.org)
    22comments
  24. The UV index is not the warm sensation of sunlight on bare skin(asciitweezers.com)
    discuss
  25. The JavaScript Midlife Crisis(maroun-baydoun.com)
    5comments
  26. Launch HN: Coverage Cat (YC S22) – Umbrella insurance via your personal agent(coveragecat.com)
    19comments
  27. Microsoft killed FoxPro in 2007. Anyway, here's FoxPro revived(foxscript.org)
    discuss
  28. Apple has added persistent 'ads' to iOS, and it's driving users crazy(techradar.com)
    392comments
  29. There's a high chance of devices being sold with GrapheneOS preinstalled in 2027(grapheneos.social)
    92comments
  30. Overreliance on AI contributed to missile strike on Iran school – Pentagon(bloomberg.com)
    125comments

A Faster Shortest Path Algorithm

27 pointsby 1h agovals.ai
5 comments
1h agoHN ↗

If I'm reading correctly, this is one of those theoretical improvements that doesn't put a whole lot of practical speedup on the table. But I do wonder how many other algorithms in computer science are going to see their bounds fall in the next few months

57m agoHN ↗

I don’t want to rain on the parade here, but this is a typical issue with AI slop maths or CS. It just builds complexity upon complexity to generate diminishing improvements (this case doesn’t lead to any practical speedup). This has been my experience in code, and also been my experience in limited Maths I know.

I think a reasonable conclusion now that AI is getting better than us humans at this, is that humans should stop doing this. I think there are strong reasons that humans should never have been doing this in the past but now it’s far more clear, AI will out complicate whatever complexity you can build and then beat at you at its handling of intricate complexity.

Humans should focus on finding simple solutions that lead to a 10X improvement. AI rarely does this, though I have noticed it some times doing this in maths, but this was the case when the solution was already present in some distant literature and no human had the expertise in 2 distant areas to make the connection. When AI does this, it is a welcome advancement, and hopefully the bridge it shows leads to exciting new developments.

But LLMs rarely do this, and I think humans should exclusively focus on this, because it seems like we are far better than LLMs at keeping things simple and finding new insights that leads to 10X, 100X improvements

55m agoHN ↗

The time complexities given in this article would be easier to read if they used |V| and |E| instead of m and n.

45m agoHN ↗

It's extremely common in graph theory to use n and m to mean vertex and edge count respectively. And if you're unfamiliar with graph theory, the notation |V| or |E| is hardly more intuitive, especially if you're not an English speaker.

16m agoHN ↗

I'm confused.

This seems to imply that they used Claude Opus 5.5 before it was released on September 22nd.