To read N evaluations in the tower proof from hint stream, we currently use a loop to move them ($4N$ felts) from hint stream to heap using ~ $4N$ StoreHintWord, $4N$ ADD and $4N$ BNE (from ZipFor).
This becomes a critical issue since the number $N = \sum_{i < T} L_i * (\textrm{n\_prods[i]} + \textrm{n\_logups}[i])$ is the product of the number of tower proofs $T$ and the number of layers $L$ in each tower.