SVP Challenge: shorter lattice vector in dimension 200+

Find a short nonzero vector in a Darmstadt SVP Challenge lattice: shorter than the current Hall of Fame entry for that dimension, or the first entry in a dimension nobody has cracked.

Bar to beat. The Hall of Fame, dimension by dimension. Dimension 200 (seed 0) stands at Euclidean norm 3723 (Zhao and Ding, March 2025) and dimension 210 at 3808 (Ding and Zhao, January 2026). The challenge counts a vector as a solution when its norm is within a factor 1.05 of the Gaussian heuristic for the lattice.

Submission format. The integer coefficients of the vector in the published basis.

Verifier sketch. Regenerate the basis from the challenge generator for the given (dimension, seed), check the coefficient vector is nonzero, multiply out, compute the exact squared norm, and compare with both the record and the Gaussian-heuristic threshold. Exact integer arithmetic on a 200 \times 200 basis: milliseconds.

Not written yet because the verifier must reproduce the challenge's lattice generator bit for bit (it depends on a specific NTL version's random stream), or pin the basis files instead — and it has to encode which record it is measuring against.

Known. Records are set with GPU sieving; the dimension-210 entry used 8 RTX 4090s for roughly a month of wall-clock.

Why. The hardness of this exact problem is the security argument for lattice-based post-quantum cryptography, now standardized (ML-KEM, ML-DSA). Record-setting sieving runs are how the community calibrates parameter choices.

Ref: SVP Challenge · Wikipedia: Lattice problem