{
  "video_id": "reddit_1wd6q5r",
  "channel_slug": "singularity",
  "channel_handle": "r/singularity",
  "title": "Implications if P-NP problem is solved?",
  "url": "https://www.reddit.com/r/singularity/comments/1wd6q5r/implications_if_pnp_problem_is_solved/",
  "external_url": null,
  "upload_date": "20260911",
  "published_at": "2026-09-11T05:06:36+00:00",
  "transcript": "So, OAI, and probably Anthropic as well, are trying their hand at this problem. We have no idea how long it might take, a few days or a few years. Intuitively, I think P ≠ NP. But what if P = NP is proved and, more importantly, a constructive proof is found? What might the real-world implications be, both in the short and long term? Those with a mathematics or theoretical CS background, could you please share your thoughts on this?\n\n\n\n--- Top Comments ---\n\n\n[91 upvotes] P = NP and constructive+efficient algorithm would break most of modern public key cryptography and simultaneously unlock massive progress in optimization and search. A non constructive proof or one with a terrible polynomial would mostly just be a deep theoretical result with limited immediate impact.\n\n[33 upvotes] it really depends on how it's solved\n\n1) p not equal to np - no difference\n2) p = np but very high order solution to an np complete problem, no difference. \n3) p = np and a solution with tractable complexity - encryption is broken, cancer is cured etc etc. everything changes cause if you can solve an NP-conplete problem, you can solve all \n\n[26 upvotes] Won’t mean anything if the polynomial time algorithm is order n^999999999. Technically polynomial time, but impractical ",
  "transcript_chars": 1268,
  "ingested_at": "2026-09-11T13:30:16.484761+00:00",
  "source": "reddit",
  "yt_meta": {
    "score": 50,
    "upvote_ratio": 0.82,
    "num_comments": 61,
    "author": "MohMayaTyagi",
    "is_self": true
  }
}