Determine computational resource data for unrun frontier blocks

Determine the exact row counts, nonzero counts, fill-in behavior, and peak memory requirements for the unrun modular-rank frontier blocks associated with the additional finite vanishing computations for the degree pairs (3,3), (2,5), and (1,8).

Background

The paper describes additional finite vanishing computations that could improve the currently established Second Main Theorem constants. These computations use the same finite maps and symmetry decompositions as the completed certificates but involve substantially larger matrix blocks.

The authors provide estimates for ambient dimensions, shard counts, operation counts, and rough running times. However, the matrix-free estimator does not construct the target rows or perform the complete elimination for the frontier blocks, so several exact computational quantities remain unresolved. Determining these data is necessary for accurate reproducibility and hardware-planning information for the proposed future computations.