The batched preprocessing of Theorem 30, in every program beginning with base58B

For every $R$ and standard limits, base58B ++ R meets PreCoreBSpec lim (base58B ++ R) cShared30: the preprocessing preCore$(L,m,t,N,D,aX,aY,b_0)$, for a source $X$ ($K_0N\times D$, entries bounded by $U$) at aX and the transpose of a source $Y$ ($D\times K_0N$) at aY, under the limits Lim30, returns within tPreCoreP cShared30 p t steps and builds the data structure DSReadyA of the batched input arrays bArrayL (stdLayout hmL) X β, bArrayR (stdLayout hmL) Y β (shared stage, all tiles, tries), keeping the memory below $b_0$.

The batched layout (Batch/Tiling): the source of the left side is a $K_0N\times D$ matrix $X$ (row by row), that of the right side a $D\times K_0N$ matrix $Y$ (stored transposed); the slot $(g,h)$ of the band $\beta$ holds the row block number $(\beta K_0+g)K_0+h$ of the source, so one run of Theorem 30's data structure computes $K_0^2$ independent block products.