Problem detail · source-aware
VibeMathed reports this item as candidate. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Is the closest vector problem NP-hard to approximate within polynomial factors $n^c$? Yes for some $c > 0$: hardness of approximation reaches polynomial factors, with consequences for decoding and related lattice problems - a foundational question underpinning post-quantum cryptography where hardness had stalled at almost-polynomial factors since the late 1990s.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
Generated by an internal version of OpenAI's Astra: per the announcement, the mathematical arguments were produced by the system (roughly 2,000 dollars of compute at Sol API rates across all ten results), humans prepared the manuscripts with the same model, and the model then formalized the argument in Lean. A narrated reasoning walkthrough is published for each result.
Provider: OpenAI · Prompt public: unknown · Independence: unknown
Kernel-checked Lean 4 certificate in OpenAI's public ten-proofs repository (Lean 4.32, mathlib, `lake build All`), with an independent Comparator checking route. Statement fidelity and community review of the day-old company announcement remain pending, hence candidate status.
Correctness: supported · statement fidelity: audited · peer review: none
VibeMathed reports this item as candidate. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Source-reported tools: argument.
Independent: unknown · difference confidence: 0
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.