Unified Capacity–Locality Problem (UCLP): a decision framework for bounded locality, bounded information injection, and valid progress accounting in polynomial-time computation. Includes the canonical CutStrings benchmark and URF-ADMISSIBLE predicate.

Chronos–URF RR — reference implementation of Chronos entropy-depth bounds and rigidity results within the Unified Rigidity Framework.

Chronos–EntropyDepth — information-theoretic limits on refinement and computation; entropy depth bounds, certificates, and executable witnesses.

Unified Capacity–Locality Problem (UCLP): a formal decision framework for bounded locality, information capacity, and progress accounting in polynomial-time computation. Includes the canonical CutStrings benchmark and URF-ADMISSIBLE criteria.

Lean 4 development repository for overlap rigidity: local cycle-overlap invariants, FOᵏ locality interfaces, and executable proofs. Dev scaffold; authoritative artifacts released from the frozen repo.

Canonical counterexamples and boundary constructions for OWC-style rigidity and capacity–locality claims. Includes explicit witnesses, verification scripts, and documented failure modes to delineate admissible vs. non-admissible regimes.