ccs-hack

CCS (Customized Constraint System) is a generic constraints representation system can simultaneously capture R1CS, Plonkish, and AIR:

$$\sum_{i=0}^{q-1} c_i \bigcirc_{j\in S_i} M_j \cdot z = 0 $$

You can easily convert CCS to R1CS, Plonkish, Air and vice versa. You can also build proof systems that directly using CCS as the constraints system, such as HyperNova, SuperSpartan.

CCS can save (or add) the fragmentation of arithmetisations!