The Lifted Merkle tree proof contains one row of the full lifted trace for each query. If two queries point to the same logical row of a smaller trace, that row will be duplicated.
This should not occur often when traces are approximately the same size, but in the context of an Air with many possible sizes (especially small ones) this could inflate the proof size artificially.
If this turns out too complicated, the alternative is to use out-of-the-box compression algorithm which sound easily detect the duplication.
The Lifted Merkle tree proof contains one row of the full lifted trace for each query. If two queries point to the same logical row of a smaller trace, that row will be duplicated.
This should not occur often when traces are approximately the same size, but in the context of an Air with many possible sizes (especially small ones) this could inflate the proof size artificially.
If this turns out too complicated, the alternative is to use out-of-the-box compression algorithm which sound easily detect the duplication.