A Reduction-Based Security Construction with Strict Capture-Time Admissibility

This paper formalizes a protocol for event admissibility under unlimited generative capability. 
Admissibility is conditioned on capture-time entropy binding, hardware-rooted identity, and irreversible public ordering. A strict refusal rule prevents retroactive anchoring. 
The paper defines a formal security game, prove reduction to collision resistance, EUF-CMA  security, entropy unpredictability, and BFT consensus persistence. 
Liveness under refusal, probabilistic location guarantees, and validator incentives are analyzed. 
Forgery is shown reducible to breaking standard primitives or violating consensus assumptions.