We have an implementation of the Ligero SNARK as described in section 4 of the paper, which is not succinct. In particular, the prover sends the verifier the entire matrix U of size 4 * k * n containing an encoding of the extended solution vector x || y || z || w. Although not discussed in the paper (at least not in section 4, it might appear elsewhere), we likely want to make this succinct in the future by instead sending a Merkle commitment to U and open the requested columns in the vein of the Ligero PCS. This will also require making the verifier's private coins in the current code (the columns to be opened) public.
We have an implementation of the Ligero SNARK as described in section 4 of the paper, which is not succinct. In particular, the prover sends the verifier the entire matrix
Uof size4 * k * ncontaining an encoding of the extended solution vectorx || y || z || w. Although not discussed in the paper (at least not in section 4, it might appear elsewhere), we likely want to make this succinct in the future by instead sending a Merkle commitment toUand open the requested columns in the vein of the Ligero PCS. This will also require making the verifier's private coins in the current code (the columns to be opened) public.