Quartz 4

The Simulation Hypothesis — Are We Code?

10 min read

The Simulation Hypothesis

In 2003, philosopher Nick Bostrom published a paper that began with a trilemma and ended with an unsettling probability argument: if it is possible to create conscious simulations, and if any civilization reaches that capability, then almost certainly you are a simulated mind.

The simulation hypothesis is not science fiction. It is a formal philosophical argument with mathematical structure, and it has generated some of the most rigorous experimental attempts at falsification in the philosophy of physics — including a landmark 2025 paper that used astrophysical energy constraints to argue that this particular universe is essentially impossible to simulate. The argument remains unresolved, but the attempts to resolve it have generated surprising physics.

Confidence: Bostrom’s trilemma established (logical argument). Physical tests emerging. Most claimed physical signatures speculative. Vazza (2025) energy constraint result emerging. Freshness: 2026-04-16. Active philosophical and physics debate.

Bostrom’s Trilemma (2003)

The argument has a simple structure. At least one of the following three propositions must be true:

  1. Extinction before simulation: All civilizations go extinct or are destroyed before reaching the computational capability to run large numbers of conscious simulations
  2. Disinterest in simulation: Civilizations that do reach that capability choose not to run large numbers of conscious simulations
  3. We are probably simulated: The fraction of all minds that are simulated vastly outnumbers the fraction that are “base-level” — making it overwhelmingly likely that any randomly chosen conscious mind (including yours) is inside a simulation

The logical skeleton: if (1) and (2) are both false, then there must exist enormous numbers of simulated minds — and their number should dwarf the number of “real” biological minds, making any randomly chosen mind almost certainly simulated.

This is not a mystical claim. It is a probability argument about ratios. Its power is also its weakness: it cannot tell us which branch of the trilemma is correct.

The Standard Counterarguments

The Substrate Independence Objection: Consciousness may require specific physical implementations — not just information processing. A simulation might produce intelligent behavior without genuine experience, undermining the argument that simulated minds “count.”

The Computational Complexity Objection: Simulating a quantum universe may be fundamentally impossible within any physical universe sharing the same computational laws. You cannot run a program larger than the computer.

The Regress Problem: If we might be in a simulation, our simulators might also be in a simulation (nested simulations). At some level, there must be a “basement” universe — and any argument about what happens in that basement is inaccessible.

The Self-Defeating Probability Objection: The probability argument requires that simulated minds are indistinguishable from base-level minds — but if they are truly indistinguishable, the probability calculation has no empirical handle. It becomes metaphysics, not science.

Can It Be Tested? Proposed Physical Signatures

The most interesting feature of the simulation hypothesis from a physics perspective is the question: would a simulated universe leave detectable fingerprints?

Lattice Cutoff in the Cosmic Ray Spectrum

Beane, Davoudi & Savage (2012) proposed that a discrete computational substrate — a lattice — would impose a maximum energy cutoff on physical interactions, analogous to the Nyquist limit in digital signal processing. They predicted this would be detectable as an anomalous directional anisotropy in ultra-high-energy cosmic rays (UHECRs), aligned with the lattice axes.

The GZK cutoff (~5 × 10¹⁹ eV) is already observed in UHECR spectra and has natural explanations (interaction with CMB photons). But a directional anisotropy would be unnatural. The current constraint from Auger and Telescope Array data sets the minimum inverse lattice spacing at ~10⁻¹¹ GeV⁻¹ — extraordinarily fine, meaning any lattice would have to be far smaller than the Planck scale. This doesn’t rule out simulation; it rules out coarse simulation.

Algorithmic Compression and Predictability

An efficient simulator would not compute what is unobserved — it would defer calculation until observation (“lazy evaluation”). Some interpretations of quantum mechanics (particularly the Copenhagen interpretation’s observer-dependence and wavefunction collapse) resemble lazy evaluation. Quantum superposition could be a computational shortcut: maintain only the probability distribution until someone looks.

This argument is suggestive but not falsifiable without knowing the simulator’s implementation details. Any universe in which superposition exists could be interpreted this way.

Infodynamics — Vopson’s Information Physics (2023-2025)

Physicist Melvin Vopson proposed infodynamics — the hypothesis that information is a physical state of matter with its own entropy law. His central claim: information entropy in physical systems spontaneously minimizes (decreases) over time, opposite to the second law of thermodynamics for energy entropy. Vopson argues this is a signature of a computational universe “compressing” its state for efficiency.

Vopson’s experimental test (published, under ongoing replication): electron-positron annihilation should produce gamma photons with a specific excess of symmetry — an infodynamic “signature.” Early results are claimed positive. Independent replications are ongoing as of 2026. Critics note that novel predictions must be quantitatively specific before the experiment, not post-hoc; this remains contested.

The 2025 Energy Constraints Paper: Near-Impossibility

The most rigorous recent attempt to rule out the simulation hypothesis on physical grounds is Franco Vazza’s 2025 paper (Frontiers in Physics, arXiv:2504.08461): “Astrophysical constraints on the simulation hypothesis for this Universe: why it is (nearly) impossible that we live in a simulation.”

The Core Argument

Any simulation of a physical universe must compute the physical state of every particle, field, and interaction within it. Computation requires energy — the Landauer principle (information erasure = heat generation, kT·ln2 per bit) sets a minimum energy cost for any computation.

Vazza calculates the minimum energy required to simulate three scenarios:

  1. The entire visible universe (at any resolution): requires energy exceeding any plausible physical source by dozens of orders of magnitude
  2. Earth only (detailed simulation): still requires energy comparable to Earth’s entire annual solar input — every second
  3. A low-resolution simulation of Earth compatible with current neutrino observation limits: technically feasible energetically, but only if the simulation is so coarse that fundamental physics as we experience it cannot be faithfully reproduced

The Key Result

In cases (1) and (2), the required computational energy is physically impossible — not merely technologically difficult — if the simulating universe shares the same physical constants as ours. You cannot run a simulation requiring more energy than the universe contains.

Case (3) is not truly ruled out: a low-resolution simulation that approximates “Earth” at a coarser level might be physically possible, but it would show detectable anomalies — deviations from standard physics — at the finest scales we can probe. Current neutrino observations (up to ~10¹⁷ eV from KM3NeT) show no such anomalies.

Caveat: The Simulator’s Universe Could Be Different

Vazza’s argument assumes the simulating civilization lives in a universe with similar physical constants. If the “basement” universe has vastly more energy, different thermodynamics, or different computational rules, the constraint collapses. The argument rules out self-similar nested simulation (us simulating a universe identical to ours), not simulation by a fundamentally different substrate.

Computer Science Perspective (arXiv 2404.16050)

A 2024 computer science paper analyzed the simulation hypothesis from the perspective of computational complexity theory. Key results:

  • Simulating quantum mechanics in full requires exponential classical compute — but a quantum computer inside a simulation could “offload” computation to quantum hardware
  • Gödel’s incompleteness theorems impose limits: any simulation system powerful enough to simulate itself would contain unprovable truths — “bugs” in the simulation that could never be corrected by the simulator
  • The question “are we in a simulation?” may be formally undecidable within the simulation itself — analogous to Turing’s halting problem

This suggests the simulation hypothesis may be permanently beyond falsification by internal observers — not for physical reasons, but for logical ones.

What Would Settle This?

No single experiment would “prove” simulation, but several classes of observations could significantly constrain it:

  1. UHECR directional anisotropy: A statistically significant correlation between highest-energy cosmic ray directions and a fixed lattice orientation would be the strongest physical evidence available
  2. Quantum decoherence at astronomical scales: If quantum superposition fails to survive over cosmological distances in a way inconsistent with standard decoherence models, it might suggest computational shortcuts
  3. Physical constant variation: Simulations might use lookup tables rather than calculating constants from first principles — if “constants” show discrete jumps or pattern, this would be suggestive
  4. Infodynamics replication: If Vopson’s electron-positron experiment replicates with quantitative predictions confirmed, infodynamics would demand explanation

None of these tests is definitive. The simulation hypothesis remains, technically, unfalsifiable in principle — but falsifiable piece-by-piece at increasing resolution.

The Strange Physics It Generates

The productive feature of the simulation hypothesis is not whether it is true, but what physics it forces us to confront:

  • It raised the hard problem of consciousness to a cosmic-scale question: if simulated minds are conscious, what substrate is required for consciousness? (concept-overview-effect touches this — the overview effect is a dramatic shift in consciousness not dependent on substrate change)
  • It connected information theory to thermodynamics — Landauer’s principle, Shannon entropy, and the arrow of time form a coherent framework whether we’re simulated or not (concept-arrow-of-time)
  • It made the quantum measurement problem feel urgent — the Copenhagen “observer” problem looks very different if observers are subroutines in a program
  • It clarified that the Fermi Paradox is a simulability constraint too: if we are in a simulation, perhaps most galaxies are low-resolution approximations, and the reason the void is silent is that only Earth is being rendered at full precision (concept-fermi-paradox, concept-bootes-void)

Cross-Realm Connections

  • concept-holographic-principle: The holographic bound — the universe’s information encoded on a 2D surface — is the most rigorous form of the idea that reality is information. If the universe is maximally information-compressed, it already resembles an optimally efficient simulation in the abstract. The AdS/CFT correspondence shows that a gravitational bulk can be exactly dual to a non-gravitational boundary theory — which is not a simulation, but is structurally analogous

  • concept-arrow-of-time: Landauer’s principle ties information erasure to thermodynamic heat generation. In any simulation, computation generates heat. The arrow of time (entropy increasing) would be, in a simulation, the direction of computation — time flows in the direction the simulator is writing bits

  • concept-neuromorphic-computing: Neuromorphic chips aim to compute with brain-level efficiency (~20 W for 86 billion neurons). A universe-scale simulation would need something orders of magnitude more efficient than anything we can conceive. The gap between a neuromorphic chip and a universe simulator is a useful calibration of how extraordinary the hypothesis actually is

  • concept-bootes-void: A 330-million-light-year sphere containing 60 galaxies instead of 2,000. If the simulation uses lazy evaluation, the interior of the Boötes Void would be the cheapest region in the observable universe to run — a vast, empty, unpopulated sector where little computes. Its unusual emptiness is consistent with (though not evidence for) selective computation

  • concept-swarm-intelligence: Conway’s Game of Life demonstrates that extraordinarily complex behavior emerges from three simple rules. The simulation hypothesis is, in part, a claim that the universe’s apparent complexity could be the output of a relatively simple ruleset — and emergent complexity does not require hand-crafted complexity at the base level

See Also

Graph View

Backlinks