Hacker News Reader

> people assume SVP is much easier to solve, closer to 2^{.29n + o(n)}.

Since when? Can you cite the relevant paper(s)?

that's the running time of the BDGL16 sieve. see the intro of e.g.

for some history