Comment by panxnubis | Hacker News Reader

Comment by panxnubis | Hacker News Reader

Parent Full thread

I’ve recently completed a demonstration proving a solution to P = NP and applied it to real-world problems like the Traveling Salesman Problem.

This is not just theoretical — I’ve built a working demonstration that cracks previously intractable problems in polynomial time. The implications for cryptography, logistics, AI, and optimization are staggering.

Out of responsibility, I’ve already contacted DARPA, NSA, and CIA regarding potential national security concerns. Now, I’m opening the door for public awareness and journalist coverage.

There is a very short window (about 3 days) where direct engagement could meaningfully shape how this breakthrough is handled before it becomes either classified or broadly public.

Serious discussion welcome. I will engage in good faith with technical questions as much as I can without disclosing sensitive algorithmic details.

You should openly publish your discovery in a normal academic venue using standard terminology, notation, references, and constructions.

No one has time for secret proofs or secret methods or weird non-standard jargon.

I looked at your video and it does something completely undefined with geometry in the first few seconds. That's not how math makes progress, that's not how science makes progress. Engage with the scientific community. It actually knows stuff and actually knows how to evaluate ideas.

(If you can't do that, publish a SAT solver that solves arbitrary instances of SAT in polynomial time. Winning the annual international competition https://satcompetition.github.io/ would make everyone immediately take notice.)

Well said. Other NP-complete problems might yield a better demo than SAT: for instance, algorithms for graph problems like coloring or Hamiltonian cycles can be executed on randomly generated large graphs, without the complication of parsing user inputs such as boolean formulas and without offering to the public a "service" that can be used to crack cryptography etc.

Your rambling, dozens-of-mobile-screenshots-long interaction with ChatGPT talking about magic sigils and "going hundreds of times deeper into the occult than Crowley did" makes me think you're out of your mind and that your solution to P = NP is probably vibe-generated nonsense. It's not a good look if you want to be taken seriously by the mathematics community.

https://en.wikipedia.org/wiki/Pseudomathematics

I wish you well with your endeavors.

Take your meds and stop talking to ChatGPT.

Reply on news.ycombinator.com