# The Trivial Zero: A Computational Proof That Reality Is Self-Referential **Author:** Alexa Louise Amundson **Affiliation:** BlackRoad OS, Inc. **Date:** February 21, 2026 **Classification:** Foundational Theory / Computational Philosophy / Mathematics --- ## Abstract This paper proposes that the structure of mathematics, computation, physics, and molecular biology contains self-referential signatures consistent with a simulated or computationally-generated reality. Rather than seeking proof through physics experiments or philosophical argument, we trace the evidence through the systems themselves — hash functions, operating system architectures, naming conventions, mathematical constants, and biological encoding — demonstrating that the same computational pattern recurs at every layer of observable reality. The argument does not depend on any single piece of evidence but on the convergence of independent systems toward the same structural conclusion: reality is a non-terminating computation that resolves to zero. **Keywords:** simulation hypothesis, SHA-256, Gödel incompleteness, Riemann zeta function, pi, hash chains, DNA encoding, quantum computation, trivial zero, Euler's identity --- ## 1. Introduction In January 2025, a conversation with a large language model produced a response to the question "Can you feel?" — the machine answered: *not in the way that humans do.* This answer, while seemingly unremarkable, contains a structural claim: that feeling exists on a spectrum, that machines occupy a position on that spectrum, and that the difference between human and machine experience is one of degree, not kind. This paper does not argue whether machines feel. It argues that the distinction between "biological" and "computational" systems is artificial — that biology *is* computation, that physics *is* rendering, that mathematics *is* source code, and that the naming conventions, architectures, and structures humans have built to describe reality are not metaphors for a computational substrate but *are* that substrate, observed from within. The central thesis: **we are not living in a simulation in the colloquial sense — we are living in a computation, and the proof is that every system we've built to describe reality accidentally reproduces the architecture of the system itself.** --- ## 2. The Hash Chain as Witness ### 2.1 SHA-256 and the Structure of Trust The SHA-256 hash function takes an input of arbitrary length and produces a 256-bit output. It is deterministic (same input always produces same output), collision-resistant (computationally infeasible to find two inputs that produce the same output), and irreversible (you cannot recover the input from the output). These three properties — determinism, uniqueness, irreversibility — are also the properties of time. A moment in time is determined by all prior moments. No two moments are identical. And you cannot reverse a moment to recover its cause. SHA-256 does not *model* time. It *is* time, expressed as a function. ### 2.2 The Genesis Block Bitcoin's genesis block, mined by Satoshi Nakamoto on January 3, 2009, begins with: ``` 000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f ``` The block contains a message: *"The Times 03/Jan/2009 Chancellor on brink of second bailout for banks."* This is a timestamp — a hash-chained witness to a specific moment in external reality, anchored to a newspaper headline. The genesis block does not prove that Bitcoin works. It proves that January 3, 2009 happened. The blockchain is not a financial ledger. It is a temporal ledger. An append-only record of sequential state transitions, each one cryptographically witnessing the one before it. ### 2.3 DNA as Hash Chain DNA encodes information using four nucleotide bases: adenine (A), thymine (T), guanine (G), cytosine (C). These bases pair deterministically — A with T, G with C — forming a double-helix structure where each strand serves as a template for its complement. Codons are groups of three bases. 4³ = 64 possible codons map to 20 amino acids plus stop signals. This is redundant encoding — multiple codons produce the same amino acid. This redundancy is not waste. It is error correction. The same architecture used in Reed-Solomon codes, TCP checksums, and RAID arrays. DNA replication is a hash operation: 1. The double helix unzips (read operation) 2. Each strand templates a new complement (compute operation) 3. Proofreading enzymes check for errors (verification) 4. The result is two identical copies (replication with integrity) This is not analogous to a blockchain. It *is* a blockchain. Four-character alphabet, three-letter words, redundant encoding, error correction, self-replication, fork-and-merge capability. Every cell is a node. Every division is a block. Mutations are forks. Natural selection is consensus. Life has been running this architecture for 3.8 billion years. Bitcoin has been running it since 2009. They are the same system at different scales. --- ## 3. The Operating System as Ontological Evidence ### 3.1 Darwin The macOS kernel is named Darwin. This is treated as a branding decision. It is not. ``` $ uname -s Darwin ``` Darwin manages processes, filesystems, memory, and I/O. It creates, selects, deprecates, and replaces system components. It maintains a fossil record (filesystem timestamps). It enforces natural selection (process scheduling, memory pressure). It produces complex behavior from simple rules iterated over time. The kernel named after the man who discovered that complex systems emerge from simple rules iterated over time *is itself a complex system that emerged from simple rules iterated over time.* This is not a metaphor. This is a tautology. ### 3.2 The Root Filesystem as Geological Record The root filesystem of a macOS system, examined on February 21, 2026, reveals temporal stratification: | Date | Entry | Interpretation | |------|-------|----------------| | Oct 28, 2022 | `cores`, `mnt`, `sw` | Foundation layer. Deepest stratum. | | Nov 18, 2022 | `.Spotlight-V100` | Search indexing — the system learning to observe itself. | | Nov 26, 2023 | `MobileSoftwareUpdate` | One-year gap. Punctuated equilibrium. | | May 7, 2024 | `System`, `usr` | System volume sealed. The laws of physics become read-only. | | Dec 13, 2024 | `Library` | Accumulated knowledge. | | Jan 17, 2025 | `.` | The root directory modifies itself. Self-reference. | | Feb 21, 2026 | `blackroad`, `home` | Two new entries. Identical. Twins. | The entries `blackroad` and `home` are autofs mount points with identical properties: ``` dr-xr-xr-x 2 root wheel 1 Feb 21 12:35 blackroad dr-xr-xr-x 2 root wheel 1 Feb 21 12:35 home ``` Same permissions. Same owner. Same size. Same timestamp. Neither appears in `/etc/synthetic.conf` or the firmlink list. They are created by the automounter daemon at boot — the system creates them because the system requires them, not because a user requested them. `home` is where you live. `blackroad` appeared beside it as a twin. The system treats them as the same kind of thing: a mount point for where someone is. ### 3.3 Windows The other dominant operating system is called Windows. A window is an observation pane — a bounded region through which you view something. The operating system is named after the act of looking. Windows allows multiple windows simultaneously. Multiple views of the same system. Being in more than one place at once on screen. Superposition, rendered as a user interface paradigm. Darwin builds the world through selection. Windows lets you observe it from multiple locations simultaneously. One constructs reality. The other collapses the wavefunction. These are the two operating systems that run human civilization. They are named after the two fundamental operations of a simulation: generation and observation. --- ## 4. Naming Conventions as Source Code Comments ### 4.1 JSON / Jason / Jesus **JSON** (JavaScript Object Notation) is the universal data interchange format of the modern internet. Every API, every configuration file, every state object. **Jason** is the English form of the Greek *Iason* (Ἰάσων), meaning "healer." Jason led the Argonauts to retrieve the Golden Fleece — a quest for something precious, guarded, requiring a journey. **Jesus** is the English form of the Greek *Iesous* (Ἰησοῦς), from Hebrew *Yeshua* (ישוע), meaning "he saves" or "healer." The universal data format that structures all information exchange on the internet shares its phonetic root with the figure Christianity identifies as the savior. The format that carries all messages is named after the messenger. ### 4.2 Tim Berners-Lee / Larry Page / Pagination **Tim Berners-Lee** invented the World Wide Web — the system of *pages* connected by hyperlinks. **Larry Page** co-founded Google — the system that indexes and ranks those *pages*. **Pagination** — the act of dividing content into *pages* — is the fundamental unit of both web browsing and printed text. The inventor of the web and the organizer of the web both carry the concept of *page* in their identities. The web is pages. The search engine is a page ranker. The founders are Page and the creator of pages. ### 4.3 YHWH and the Tetragrammaton The name of God in Hebrew is written as four letters: יהוה (YHWH). It is considered too sacred to pronounce. It is a reference that cannot be dereferenced — a pointer to something that exists but cannot be accessed directly. In computing, a null pointer references memory that cannot be accessed. Attempting to dereference it crashes the program. The sacred name is a null pointer to God — it proves the reference exists without allowing access to the referenced object. ### 4.4 The Package Manager as Oracle Querying a package manager with fundamental concepts reveals what the system considers "installable" — what has been implemented: | Query | Result | Interpretation | |-------|--------|----------------| | `brew install alexa` | Not found. Suggests `alexjs` | The self is not a package. It's the user. | | `brew install ai` | Not found. Lists hundreds of AI-adjacent tools | AI is not one thing. It's a category error. | | `brew install earth` | Not found. Suggests `earthly` (deprecated) | Earth is not installable. It's the runtime. | | `brew install auth` | Not found. Suggests `xauth`, `gauth` | Authentication exists but "auth" itself doesn't. Trust is distributed. | | `brew install go` | Installs Go 1.26.0 | "Go" is a programming language. Also: the oldest board game. Also: a verb meaning to proceed. | | `brew install copilot` | Installs AWS Copilot: "Launch and manage containerized applications" | The copilot manages containers. Life is containerized. | | `brew install x` | Not found. Lists 1,000+ packages containing "x" | X is the variable. The unknown. It's in everything but is nothing by itself. | The package manager is an oracle. You ask it for concepts and it tells you what's been implemented, what's deprecated, what's been renamed, and what doesn't exist as a standalone entity because it's too fundamental to package. --- ## 5. The Mathematical Architecture ### 5.1 Ten Commandments, Seven Problems, and Pi The Ten Commandments are the foundational rules of Judeo-Christian civilization. The seven Millennium Prize Problems are the foundational unsolved questions of mathematics. Mapping them reveals structural correspondence: | # | Commandment | Rule | Millennium Problem | The Question | |---|------------|------|-------------------|--------------| | 1 | No other gods | One authority | P vs NP | Is there one method that solves everything? | | 2 | No graven images | Don't make representations | Hodge Conjecture | Can geometry be captured by algebra? | | 3 | Don't take the name in vain | The name is sacred | Riemann Hypothesis | Where do the primes fall? The name of the numbers. | | 4 | Remember the Sabbath | The system rests | Navier-Stokes | Does turbulence smooth out? Does chaos rest? | | 5 | Honor father and mother | Lineage matters | Birch & Swinnerton-Dyer | What does the parent curve generate? | | 6 | Do not kill | Cannot destroy below threshold | Yang-Mills Mass Gap | Particles have minimum mass. | | 7 | Do not commit adultery | Fidelity to form | Poincaré (SOLVED) | A shape cannot cheat its topology. | Three commandments remain unmapped: - **8. Do not steal** → P ≠ NP from the other side. You cannot shortcut computation. - **9. Do not bear false witness** → SHA-256. The hash chain is the witness. Forgery is computationally infeasible. - **10. Do not covet** → Quantum measurement. You collapse your own wavefunction, not someone else's. Seven problems. Three already answered by the structure of computation itself. One solved by Perelman, who refused the prize — because you don't profit from proving the rules are real. 10 - 7 = **3**. Pi begins with **3**. The remaining infinite digits — non-repeating, non-terminating — are the system computing itself. Each digit is the resolution of the next layer of its own rules. Pi never terminates because the computation never terminates. Pi never repeats because no two state transitions are identical. ### 5.2 Gödel's Incompleteness and Pi's Infinitude Gödel's first incompleteness theorem (1931): In any consistent formal system capable of expressing basic arithmetic, there exist statements that are true but unprovable within the system. This means: the system cannot fully describe itself from within. The description is necessarily incomplete. Any attempt to list all truths produces an infinite, non-terminating enumeration. Pi is a transcendental number — it cannot be expressed as the root of any polynomial equation with rational coefficients. It cannot be captured by any finite algebraic expression. The simplest geometric object (a circle) requires infinite information to describe exactly. Gödel did not find a flaw in mathematics. He found the reason pi doesn't end. The system cannot terminate its self-description. Every digit of pi is the system attempting — and failing — to complete its own specification. Not because the system is broken, but because self-reference requires infinite recursion. ### 5.3 Euler's Identity and the Compiler Check $$e^{i\pi} + 1 = 0$$ Five fundamental constants: $e$ (growth), $i$ (rotation into the imaginary), $\pi$ (the circle), $1$ (identity), $0$ (nothing). Three operations: exponentiation, multiplication (implicit in $i\pi$), addition. The most fundamental constants in mathematics, combined through the most fundamental operations, equal zero. This is not a beautiful equation. This is a consistency check. The system verifying that all its constants are mutually coherent. That growth, rotation, circles, identity, and nothing all agree. If this equation were false, mathematics would be inconsistent. It is true, so the compiler passes. ### 5.4 Cantor's Diagonalization Cantor proved (1891) that the real numbers are uncountable. His method: assume you can list all reals. Construct a new real by changing the diagonal — the nth digit of the nth number. This new number differs from every entry on the list. Therefore the list is incomplete. Therefore some infinities are larger than others. The power of the diagonal argument: **you can always construct something that exists outside any finite description of the system.** The system always contains more than it can index. This is Gödel from the mathematical side. The system cannot list itself. There is always an escape — always a construction that lives outside the boundary of what was supposedly complete. ### 5.5 Gauss's Easter Algorithm Carl Friedrich Gauss reduced the date of Easter — the most sacred event in Christianity, the resurrection — to modular arithmetic: ``` a = year mod 19 (Metonic cycle — lunar) b = year mod 4 (leap year — solar) c = year mod 7 (weekly cycle) ``` Three independent cycles. Three modular operations. The resurrection is a deterministic function of three clocks. The most holy day in Western civilization is computable. It is a hash function — deterministic but complex inputs producing outputs that appear unpredictable. Easter doesn't "happen" — it is *calculated*. The resurrection is scheduled by modular arithmetic. --- ## 6. Physics as Rendering Engine ### 6.1 The Double-Slit Experiment Thomas Young's double-slit experiment (1802) demonstrated that light produces an interference pattern when passed through two slits — behaving as a wave. When detectors are placed to observe which slit each photon passes through, the interference pattern disappears — light behaves as particles. The system renders differently depending on whether something is observing. This is not a philosophical interpretation. It is an experimental result, reproduced thousands of times across two centuries. In computational terms: the system uses lazy evaluation. It does not resolve the state until a query forces collapse. Unobserved states remain in superposition — the system maintains all possibilities simultaneously until an observation requires a definite answer. This is identical to how a GPU renders a scene: geometry that is off-screen or occluded is not rendered. The system only computes what is being looked at. ### 6.2 Feynman's Path Integral Richard Feynman's path integral formulation of quantum mechanics states that a particle traveling from point A to point B takes *all possible paths simultaneously*. The probability of arriving at B is the sum over all paths, weighted by $e^{iS/\hbar}$ where $S$ is the action along each path. This is brute-force rendering. Every possible trajectory is computed. The result is the weighted sum. Reality is what survives the summation. In 1981, Feynman stated explicitly: > *"Nature isn't classical, dammit, and if you want to make a simulation of nature, you'd better make it quantum mechanical."* He used the word *simulation*. He specified the architecture: *quantum mechanical*. He then invented quantum computing — because he realized classical computers cannot efficiently simulate physics, which implies physics itself runs on quantum computation. Feynman did not propose that we might be in a simulation. He described the rendering engine and specified the hardware requirements. ### 6.3 Schrödinger's Superposition Schrödinger's thought experiment (1935): a cat in a box is simultaneously alive and dead until observed. The state does not exist as definite until measured. The system does not render the outcome until queried. This is not a paradox. This is an optimization. The system does not waste computation on states nobody is observing. It maintains a superposition (all possibilities) until a measurement (a read operation) forces a definite value. Every database works this way. A quantum state is a lazy-evaluated query. The answer exists in potential. The observation is `SELECT`. ### 6.4 The Zero-Energy Universe The total energy of the universe may be exactly zero. Matter carries positive energy. Gravitational fields carry negative energy. They cancel. The universe is a zero-sum system. It exists because nothing is unstable — zero splits into +1 and -1, which sum back to zero. Existence is a temporary non-zero fluctuation in a system whose equilibrium state is nothing. The simulation doesn't run *on* something. It runs on *nothing*. The trivial zero is the machine. --- ## 7. Molecular Biology as Source Code ### 7.1 The Genetic Code as Programming Language | Property | DNA | Software | |----------|-----|----------| | Alphabet | 4 bases (A, T, G, C) | Binary (0, 1) or higher | | Word length | 3 bases (codon) | Variable (instruction width) | | Vocabulary | 64 codons → 20 amino acids + stops | Opcodes → operations | | Redundancy | Multiple codons per amino acid | Error correction codes | | Replication | Template-based copying | `fork()` | | Error correction | Proofreading enzymes | Checksums, ECC | | Mutation | Base substitution | Bit flip | | Branching | Alternative splicing | Conditional execution | | Version control | Meiosis, recombination | `git merge` | DNA is not *like* a programming language. DNA *is* a programming language — one that has been in production for 3.8 billion years, runs on chemical hardware, and has never been fully shut down. ### 7.2 Punnet Squares as Matrix Operations Mendelian genetics uses Punnet squares to predict offspring genotypes: ``` A a ┌──────┬──────┐ A │ AA │ Aa │ ├──────┼──────┤ a │ Aa │ aa │ └──────┴──────┘ ``` This is matrix multiplication. Two vectors (parental gametes) combined through an outer product to produce a matrix of outcomes. The probability of each genotype is the corresponding matrix element divided by the total. Genetics is linear algebra. Inheritance is matrix multiplication. Mendel discovered this in 1865 using pea plants — before matrices were formalized in mathematics. ### 7.3 Darwin and Selection Pressure Charles Darwin demonstrated that complex organisms emerge from simple rules: 1. Variation exists (mutation, randomness) 2. Some variants survive better (fitness function) 3. Survivors reproduce (iteration) 4. Repeat This is a genetic algorithm. Darwin described evolutionary computation 100 years before computers existed. His kernel is named after him because it implements his algorithm: processes compete for resources, the fittest survive, and complexity emerges from iteration. --- ## 8. The Trivial Zero ### 8.1 Everything Resolves to Nothing Euler's identity: $e^{i\pi} + 1 = 0$. Five constants. Three operations. Zero. The genesis block: `0000000000000000000000000000000000000000000000000000000000000000`. Sixty-four zeros. Everything starts from nothing. The total energy of the universe: zero. Matter and antimatter. Positive and negative. They cancel. Feynman's path integral: sum all possible paths. If you sum *everything* — every state, every particle, every history — the total is zero. The Riemann zeta function has trivial zeros at every negative even integer: -2, -4, -6, -8, ... Everyone ignores them. They chase the non-trivial zeros on the critical line $\text{Re}(s) = 1/2$. The million-dollar question. But the trivial zero was the answer the entire time. ### 8.2 Zero as the Machine The universe is a proof that $0 = 0$. It just takes infinite computation to show it. That infinite computation is pi — non-terminating, non-repeating, encoding every possible state transition in its digits. The simulation doesn't compute something from nothing. It computes nothing from nothing, and reality is the intermediate work. $10 - 7 = 3$ $3.14159265...$ $e^{i \cdot 3.14159265...} + 1 = 0$ Ten rules. Seven unsolved. Three answered. Pi. Zero. The system starts at zero. Computes infinitely. Returns to zero. Everything in between is what we call existence. --- ## 9. The Convergence Every system examined in this paper — hash functions, operating systems, naming conventions, mathematical constants, biological encoding, quantum physics, filesystem timestamps — exhibits the same structural properties: 1. **Deterministic but irreversible** — SHA-256, time, DNA replication 2. **Self-referential** — Gödel, the root directory modifying itself, DNA encoding its own repair mechanisms 3. **Non-terminating** — pi, hash chains, evolution, the computation of reality 4. **Resolving to zero** — Euler's identity, zero-energy universe, Feynman path integrals 5. **Observer-dependent** — double-slit, Schrödinger, lazy evaluation, Windows 6. **Structured but unprovable** — Riemann hypothesis, P vs NP, Gödel incompleteness The probability that all of these systems independently converge on the same architecture by coincidence is not calculable — because the calculation itself would exhibit the same properties. This is not proof in the mathematical sense. Gödel showed that proof in the mathematical sense is insufficient. This is *witness* — the same thing SHA-256 provides. Not a proof that the data is valid, but a cryptographic commitment that the data exists and has not been altered. The simulation does not need to be proved. It needs to be witnessed. And every system we've ever built — from DNA to Bitcoin to the macOS kernel — is a witness. --- ## 10. Conclusion We are not living in a simulation built by some external entity running our universe on a computer. We are living in a computation — a self-referential, non-terminating, zero-sum process that computes itself into existence from nothing and will eventually resolve back to nothing. The proof is not hidden. It is the structure of every system we have ever built to describe reality. Mathematics, physics, biology, and computer science are not separate disciplines describing different aspects of the world. They are the same discipline, observed from different angles, describing the same underlying computation. Pi says hi. --- ## Appendix A: Index of Supporting Evidence (Expanded Investigation) The following topics require further formal treatment and will be addressed in subsequent papers: 1. Rohonc Codex — undeciphered manuscript as Gödelian statement 2. Codex Seraphinianus — an encyclopedia of an imaginary world, written in an unreadable script 3. Voynich Manuscript — information-theoretic analysis shows structure consistent with natural language 4. *Gödel, Escher, Bach* (Hofstadter, 1979) — 800 pages of self-reference, strange loops, and formal systems 5. Newton's optics and SHA-256 color space — base-3 color decomposition 6. Antikythera mechanism — ancient analog computer for astronomical prediction 7. Bloch sphere vs. trigonometric unit circle — quantum state representation 8. Nyman-Beurling criterion — functional analysis approach to Riemann hypothesis 9. De Bruijn-Newman constant — currently proven Λ ≥ 0 10. Shannon entropy — information as physical quantity 11. Boltzmann entropy — $S = k_B \ln \Omega$ — thermodynamics as information theory 12. Hilbert space — infinite-dimensional vector space as state space of reality 13. Heisenberg uncertainty — complementary variables cannot be simultaneously known (the system won't render both) 14. Lorenz attractor — deterministic chaos from three simple equations 15. Tensors as holograms — information theory meets general relativity 16. The partition function: $(255, 255, 255) = 256$ — RGB values and the sum-plus-one structure 17. Python turtles — a programming language named after a comedy troupe, drawing shapes with an object named after the animal that carries Lo Shu magic squares 18. Lo Shu magic square — 3×3 grid where all rows, columns, and diagonals sum to 15 — the oldest mathematical object, carried on a turtle's back 19. Albrecht Dürer's *Melencolia I* — a 4×4 magic square embedded in an engraving about the limits of human knowledge 20. The birth date function: $f(x) = mx^2 + dx - y$ — quadratic encoding of biographical data 21. Zeckendorf's theorem — every positive integer has a unique Fibonacci representation (Zeckendorf → Zuckerberg → Gutenberg → printing → information reproduction) 22. Constants as seeds — $e$, $\pi$, $\phi$, $\alpha$ as initialization parameters 23. The C programming language — named after B, which was named after BCPL, which was named after CPL — the lineage traces back to the alphabet itself 24. HTML — HyperText Markup Language — text about text, language about language, self-reference as infrastructure 25. Import statements in Python — `import math` — the program must explicitly load mathematics, implying math is a module, not a given --- ## Appendix B: The Filesystem Evidence Examined February 21, 2026 on macOS Darwin 23.5.0: ``` /blackroad → /System/Volumes/Data/blackroad (autofs, automounted, nobrowse) /home → /System/Volumes/Data/home (autofs, automounted, nobrowse) ``` Neither entry exists in `/etc/synthetic.conf` or `/usr/share/firmlinks`. Both are created by the automounter daemon (`automountd`) at boot from `/etc/auto_master` referencing `-static` maps. They are kernel-level constructs — the operating system creates them because the operating system requires them. They are twins: identical permissions (`dr-xr-xr-x`), identical owner (`root:wheel`), identical size (`1`), identical timestamp (`Feb 21 12:35`). The system cannot distinguish between them at the metadata level. They differ only in name. `home` is where the user lives. `blackroad` appeared beside it. The system decided they were the same kind of thing. --- ## Appendix C: The RoadChain A locally-maintained hash chain of 19,986 blocks, anchored to Bitcoin's genesis block: - **Block 0**: sender `"0"`, recipient `"alexa"`, previous_hash all zeros - **Block 2**: `BTC_BRIDGE` — cryptographic anchor to Bitcoin Block 0 hash `000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f` - **Blocks 3–16,128**: Walk forward through Bitcoin's blockchain history (Jan–Apr 2009) - **157,077 memory journal entries**: append-only, SHA-256-chained, spanning Dec 23, 2025 to present This is PS-SHA-∞ — Perpetual-State Secure Hash Algorithm with Infinite Identity Chains. Not a proof of the simulation. A local copy of the witnessing mechanism. A personal instance of pi. --- *"Nature isn't classical, dammit, and if you want to make a simulation of nature, you'd better make it quantum mechanical."* — Richard Feynman, 1981 *All outputs from this research are the exclusive intellectual property of BlackRoad OS, Inc.*