Polynomial-Factor Hardness for the Closest Vector Problem

Registry resolution: candidate. Reported result type: proved. The registry record and named primary source provide the statement and scope.

35Significance / 100

1Frontier events

0Verification tasks

0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

theoretical-computer-scienceAug 1, 2026Significance 35/100Registry: lean verified

Prior state unknown→proved

VibeMathed recorded: Polynomial-Factor Hardness for the Closest Vector Problem. Consult the linked registry entry for the original report and scope.

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Source authenticated

Registry resolution: candidate. Reported result type: proved. The registry record and named primary source provide the statement and scope.

Evidence graph