question: use "Concretely Efficient Lattice-based Polynomial Commitment" in place of regular Ajtai?

[Autoparallel]

Idea

I've been reading about LatticeFold and other lattice based techniques in ZK-SNARKs and I also came across this paper: Concretely Efficient Lattice-based Polynomial Commitment. In short, in seems to propose a more efficient commitment technique that would possibly be a speedup over the basic Ajtai commitment used here. Though I'm not 100% certain it is a drop in replacement.

They do have an implementation here: celpc.

Curious what you all think!