Great paper! Thank you for sharing.
Just a quick question: in your approach you make Pedersen commitments for rows while linearly combine columns. In this post Faster block/blob propagation in Ethereum the commitments are made for columns which makes proof for w simpler from my perspective and don’t require extra interaction (sending projection vectors p). What are the pros of row commitments then?