Record history
Compare the progress of selected categories over time.
Choose categories
Choose up to 8 categories. Matching cost scales share one chart; other scales get separate charts.
These categories use different cost scales and are shown in separate charts.
Strict improvement Other result
Time coefficient
2^{c n + o(n)}; n; smaller coefficient is betterEach line is the best listed numerical bound within its own category. Circles mark strict improvements; hollow diamonds mark other relevant numerical results, including ties, at their own source dates. Diamond markers never change the best-bound line. Bounds remain horizontal until the next dated improvement. No line is drawn before the first known result. Year/month dates use the recorded conservative cutoff. A line continuing to the data release date is not a forecast.
Classical · Provable · Worst case
Regime and assumptions
Exact Euclidean SVP on arbitrary full-rank lattices
Return a shortest nonzero vector in an arbitrary n-dimensional Euclidean lattice. Compare the coefficient c in 2^{c n+o(n)} time; polynomial input-size factors are suppressed. Record space separately.
Scale: 2^{c n + o(n)}; parameter n.
Classical · Heuristic · Heuristic random lists
Regime and assumptions
Euclidean SVP under sieve heuristics
State the sieve heuristic and memory model. A heuristic exponent cannot be entered as a worst-case provable result. No practical timing or concrete-security claim follows from the leading exponent alone.
Scale: 2^{c n + o(n)}; parameter n.