This paper introduces Cryptographic Phase, a reframing of cryptographic freshness from a procedural safeguard into a declared, cryptographically enforced semantic coordinate. Conventional cryptographic mechanisms - nonces, timestamps, counters, and validity windows - successfully prevent replay and enforce ordering, but remain blind to a growing class of failures: silent semantic reuse. In modern systems, artifacts often remain cryptographically valid long after the assumptions, policies, or interpretive rules under which they were created have changed. Meaning drifts while signatures still verify. Cryptographic Phase addresses this gap by treating time not as an inferred property of recency, but as an explicit semantic scope. A phase is a stable, referential namespace that binds artifacts, identities, and equivalence claims to a specific regime of admissible interpretation. When phases are placed under cryptographic authority and governed transitions, they become epochs: auditable semantic eras enforced by signatures and refusal rather than heuristics or social consensus. The paper formalizes phase-aware verification as a refusal-first primitive. Artifacts are admissible only if their declared phase matches an accepted epoch and their authority chain is valid. Continuity across epochs is never assumed; it must be explicitly declared, signed, and optionally constrained. This enables systems to prevent semantic replay, authority laundering, and implicit reinterpretation across policy changes, compiler upgrades, governance transitions, and distributed environments. Cryptographic Phase is orthogonal to versioning, logical clocks, consensus protocols, and content addressing. It governs interpretation, not ordering; admissibility, not availability. It is designed to be incrementally adoptable and particularly suited to software supply chains, offline-first systems, governed runtimes, and epistemically instrumented filesystems. This work positions Cryptographic Phase as a foundational primitive for meaning-preserving computation: a way to say not only that something is valid, but under which declared semantic regime it is allowed to mean what it means.
Adam Ableman Mazurk (Fri,) studied this question.