Metacomplexity

Public aggregation module for ordinary and oracle-relative machine description complexity, finite incompressibility, dependency-table codecs, finite list decoding and Hamming geometry, and the minimum-resource problems built from them, including canonical MCSP, strict-threshold MINKT, and conditional MinKT instances. Canonical MCSP also exposes its exact finite Shannon threshold window, while raw GapMCSP supplies the bare 2^n-bit input convention used by hardness magnification and SuccinctMCSP supplies typed sampled constraints. Finite anti-checkers characterize when those sampled constraints reject. Positive rational exponent scales and the selected finite magnification parameters make rounded thresholds and lower-bound quantifiers explicit.