Boolean satisfiability problem

That's what this did.

It just went straight from 3SAT to a CVP problem, this PROC CVP problem.

Nice.

And it did so with really just elegant, beautiful algebraic encoding of the 3SAT formula.

You have to take a 3SAT formula and translate it to a CVP, a lattice and a target point, and satisfying certain properties.

And it just did it straight.

It's like, oh, yeah, we're going to encode these whole formula as a Reed-Solomon code, a Reed-Solomon codeword.

And to just like confirm, I know we all know this from undergrad, but to confirm what we definitely learned in 376, like when you're doing the reduction there, the goal is to say, look, three set, we all agree, you know, is NP hard.