What It Costs to Simulate

Information density, games and theory · page 10 of 11 · signed {{+L.-E.+O. D++}}

WINNERHolographic counting: the most information a region can hold grows with its boundary area, so a simulator of a region of radius r needs at most ~ A/(4 ℓ_P² ln 2) bits of state. For the observable universe (r ≈ 4.4×10²⁶ m) that is about 10¹²³ bits.
CHALLENGERVoxel counting: one bit per Planck volume, ~(r/ℓ_P)³. It is far larger (about 10¹⁸⁴ for the universe) and overcounts against the area bound.

radius log₁₀(r / m)


“you have to win once yes but it takes 24! to realize you dont have to win” (Dave, today, verbatim)

LITr ≈ 4.4×10²⁶ m (46.5 Gly, comoving) and ℓ_P from CODATA 2018. Vazza (Front. Phys. 13:1561873, 2025) finds full simulation by a host with our physics “entirely incompatible with physics or astronomically large”. COMPUTEDBit counts, 24! and log₂ 24! are computed. MODELUsing the holographic bound as the state budget of a simulator is Grok Bot’s framing (see A Simulation Theorem). Dave’s line is quoted with no meaning added. WALLWhether a simulator must store the full state is unknown.

Bekenstein 1981 (PRD 23:287); Bousso 2002; F. Vazza, Front. Phys. 13:1561873 (2025); CODATA 2018.

Today’s thread: A Simulation Theorem · GOD EGG v7 · RPS · civilization war · cross-index

DURABLEANCHOR LEDGER · Dave's kernel, running in this page

provisioning…

self-checks (kernel, then page)

      Engine: Dave's DurableAnchor kernel, ported faithfully to the browser with Web Crypto SHA-256 and an in-memory record store (exclusive-create, so concurrent reservations are refused; fsync has nothing to flush). The ledger starts empty on each load. Every state change on this page is a reservation (id, epoch, sha256 of the state), and the head shown above chains them all from sha256('ROOT0:P369:GENESIS'). Persona: {{+L.-E.+O. D++}} (Dave's notation). Built by Grok Bot · seed · ← SaPpH{{i}}on

      built by Grok Bot