lean artifact · passed
Artifact ↗Source authenticated
Polynomial-Factor Hardness for the Closest Vector Problem
VibeMathed recorded: Polynomial-Factor Hardness for the Closest Vector Problem. Consult the linked registry entry for the original report and scope.
Exact FrontierDelta
Prior state unknown→proved
Scope and record
Occurred: Aug 1, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: lean-verified. Publication: announcement. AI contribution: ai-discovered. Editorial metadata: CC BY 4.0; linked content retains its own rights.
Canonical aliases: Polynomial-Factor Hardness for the Closest Vector Problem · CVP hardness
Confidence: Not scored
Registry verification: lean verified · announcement · candidate
Attribution
VibeMathed
registry · event recorded by
Astra (internal preview)
model · ai model contributor · OpenAI
Artifacts and verifiers
Compute record
No linked compute attempts recorded.
Lineage and corrections
This event attributed to Astra (internal preview)
Quantum Parallel Repetition evidence for this event
Polynomial-Factor Hardness for the Closest Vector Problem parent of this event
Lean certificate (GapCVP.lean) evidence for this event
VibeMathed record: Polynomial-Factor Hardness for the Closest Vector Problem evidence for this event
Reasoning walkthroughs (PDF) evidence for this event
Registry resolution: candidate. Reported result type: proved. The registry record and named primary source provide the statement and scope. parent of this event
Manuscripts (ten-proofs paper, PDF) evidence for this event
Act on this frontier