We introduce multivariate multicycle (MM) codes, a new family of quantum error-correcting codes (QECCs) that unifies bivariate bicycle, multivariate bicycle, abelian two-block group algebra, generalized bicycle, trivariate tricycle, and toric codes. MM codes are Calderbank-Shor-Steane (CSS) codes defined from length-$\textit{t+1}$ chain complexes with $\textit{$t \ge 4$}$. The chief advantage of these codes is that they possess metachecks and high confinement that permit complete single-shot decoding. We offer a framework that facilitates the construction of long-length chain complexes through the use of Koszul complex. In particular, obtaining explicit boundary maps (parity check and metacheck matrices) is particularly straightforward in our approach. This simple but very general parameterization of codes permitted us to efficiently perform a numerical search, where we identify several MM code candidates that demonstrate these capabilities at high rates and high code distances. Examples of new codes with parameters $[[n,k,d]]$ include $[[96, 12, 8]]$, $[[144, 12, 12]]$, $[[216, 12, 14]]$, $[[288, 12, 16]]$, $[[324, 12, 20]]$, $[[432, 12, 27]]$, $[[486, 24, 12]]$, $[[630, 70, 9]]$, and $[[648, 18, 23]]$. Notably, our codes achieve confinement profiles that surpass all known single-shot-decodable quantum CSS codes of practical blocksize. Our codes are also the first explicit instances of collapsed 5D through 9D higher dimensional QECCs, with check weights significantly lower than those of recent small instances of quantum Tanner codes.