Learning Toeplitz matrices are a thing and that tweaks in EigenDAs proving pipeline accelerates our performance
In EigenDA, RS Encoding & polynomial evaluations can be expressed as Toeplitz matrices
FFT-based Toeplitz multiplication + blob-aware sizing = speedy KZG proofs