Holographic Capacity from Admissibility Structure: Executable Derivation of a Ten-Fold Extension of the Bekenstein Hawking Entropy Bound

This repository contains the full paper and executable framework for “Holographic Capacity from Admissibility Structure.” The work investigates the informational structure underlying the Bekenstein–Hawking entropy bound and proposes a relational extension of holographic capacity. In the standard formulation, black hole entropy is given by S = A / (4 lₚ²) where A is the horizon area and lₚ is the Planck length. This expression is widely interpreted as representing the maximal information that can be stored within a gravitational region. The present work explores an alternative interpretation: that the Bekenstein Hawking entropy counts only a restricted subset of admissible informational degrees of freedom associated with horizon states. In particular, the entropy bound is interpreted as counting diagonal contributions within a broader relational admissibility structure. Under this perspective, additional informational modes arise from relational coordination among horizon states. When these coordination modes are incorporated into the admissibility framework, the total information capacity of the system increases beyond the classical bound. The analysis presented here shows that the extended relational structure yields a total informational capacity approximately ten times larger than the Bekenstein Hawking entropy. The framework is implemented computationally, and the repository includes simulation tools used to explore the admissibility structure, generate figures, and test analytic relationships. This record provides both the theoretical paper and the complete executable implementation used in the analysis.