The Chonkerton

Semiclassical Gravity Efficiently Solves NP-Complete Problems

science

A new arXiv preprint claims that semiclassical gravity—merging quantum mechanics and general relativity—can efficiently solve NP-complete problems, the computational puzzles that protect modern encryption. If true, it would rewrite computer science. For now, the paper remains unreviewed and has generated only modest interest on Hacker News, so healthy skepticism is warranted.

Source: https://arxiv.org/abs/2606.14806

Listen to this story

Hear this and more stories in a personalized audio briefing.

Open The Chonkerton