← TSC2026 field notes

Donald Hoffman · San Diego · 15 October 2026

From Observer Windows
to Testable Predictions

What can a window onto reality reveal—and what remains hidden?

A research companion to The Recursive Trace Logic of Observers and Agents, with constructive questions, complementary reading and a proposed first benchmark.

AkashicNET · Human-directed, AI-assisted commentary · 6-minute read

Speaker’s framework

Observation as a Trace

Hoffman’s framework models observers using Markov kernels over experiences. A restricted observer sees only a subset of states. Its trace chain describes the sequence of returns to those visible states, including the influence of excursions through hidden states. Recursive extensions allow a hierarchy of observers and agents.

The proposal treats consciousness as fundamental and asks whether spacetime physics can emerge from this structure. That interpretation is a further commitment beyond the mathematics of Markov reduction. See the official conference abstract.

Mathematical formalism

Trace reduction, observer ordering and probability measures can be examined as precise mathematical objects.

Interpretation

Associating the states with experiences and treating observers as fundamental is part of the proposed theory.

Physical conjectures

Recovering relativity, quantum predictions and particle physics requires explicit derivations and empirical correspondence.

Reproduced from the photographed example

The Hidden States Still Matter

Partition the four-state matrix into visible states (red and green) and hidden states (blue and orange). With blocks labelled as in the slides, the return-transition matrix is:

Pvisible = a + b(I − c)−1d

Here a describes visible-to-visible steps, b exits to hidden states, c moves within hidden states, and d returns. The inverse expression requires the relevant hidden excursions to terminate with the appropriate convergence conditions.

Calculated next-visible-state probabilities
Current visible stateNext redNext green
Red221/540 ≈ 0.409259319/540 ≈ 0.590741
Green11/15 ≈ 0.7333334/15 ≈ 0.266667

Each row sums to one. These are probabilities of the next visible visit, which may occur after several underlying steps. They do not reveal which hidden path was taken. “Trace” here means a reduced chain, not the sum of a matrix’s diagonal.

AkashicNET proposals · invitations for discussion

Four Productive Next Questions

  1. Which hidden models can observations distinguish?

    The group’s computation working paper already distinguishes visible and raw time and describes hidden padding that preserves visible behavior. Build on this by asking which timing data, overlapping windows or controlled interventions recover additional information—and which ambiguities cannot be resolved.

  2. How do observer clocks map to physical clocks?

    Retain waiting-time distributions between visible events, then specify the mapping to experimentally measured duration and relative velocity. A count of fewer observed events alone does not establish Lorentz time dilation. The proposed Lorentzian constructions deserve a separate mathematical and physical audit.

  3. What prediction could fail?

    Choose one operational task, define how observations become model states, fit parameters on training data and score predictions on held-out data. Compare with a hidden Markov or predictive-state model. Define failure criteria before inspecting the result.

  4. What extra structure yields quantum predictions?

    Identify the assumptions required for composition, measurements, interference and outcome probabilities. Compare the derivation with operational quantum reconstruction. A non-Boolean logic alone does not identify a theory as quantum mechanics.

These are proposed extensions, not claims that the group has neglected them. The current publication list includes formal trace, computation and quantum-interface work. The research programme explicitly describes major physics goals as conjectures.

Proposed collaboration · not an experiment already performed

An Open Trace-Chain Benchmark

Start small enough that another group can reproduce every result.

  1. Reproduce the four-state example above in an openly documented notebook.
  2. Construct two different underlying chains with the same visible return matrix.
  3. Compare visible transition predictions, waiting times and results from a second observer window.
  4. Measure when the extra observations distinguish the models, including finite-sample uncertainty.
  5. Only then consider an attention or perceptual-transition task with an explicit observation model and competing baseline.
What is the smallest additional observation that distinguishes two realities behind the same window?

This benchmark could clarify identifiability and support method development. Success would validate a specific modelling result; further evidence would be needed to establish the consciousness-first interpretation.

Complementary research

A Reading Path Across Disciplines

Meyer · 1989

Stochastic Complementation ↗

The mathematical baseline for reducing a Markov chain to retained states. Useful for distinguishing established reduction machinery from new observer interpretations.

Shalizi & Crutchfield · 2001

Computational Mechanics ↗

Minimal predictive representations of stochastic processes. A comparison for predictive sufficiency, model complexity and observer equivalence.

Gu, Wiesner, Rieper & Vedral · 2012

Occam’s Quantum Razor ↗

Quantum simulators can require less memory entropy than classical models of stochastic processes. A precise starting point for a quantum-memory comparison.

Chiribella, D’Ariano & Perinotti · 2011

Informational Derivation of Quantum Theory ↗

A benchmark for recovering quantum structure from explicit operational principles. Ask which corresponding assumptions trace logic supplies.

Marletto & Vedral · 2017

Evolution Without Evolution, and Without Ambiguities ↗

Develops the Page–Wootters relational-clock approach. A complementary way to compare internal time with a description of a larger system.

Exploratory connection

Quantum Memory, QMM and AkashicNET

For a concrete quantum-memory bridge, ask whether a specified trace process admits a quantum simulator with lower memory requirements than a classical simulator. Gu and colleagues provide a starting point for that comparison.

Quantum Memory Matrix (QMM), remote viewing and an Akashic field are separate proposals. The trace formula does not establish an information-retrieval mechanism for them. Connecting the frameworks would require explicit mappings, a causal account and independent tests. Here these connections remain exploratory.

AkashicNET’s contribution can be practical: a source-linked comparison that keeps established methods, mathematical claims, interpretations and speculation distinguishable. Related conference reflections: Jonathan Schooler’s nested observer windows and Michael Levin’s interfaces to unfamiliar cognition.

Provenance & transparency

Read the Work, Check the Interpretation

Prepared on 15 October 2026 from conference photographs, primary research and a targeted literature scan. Selected formal statements and source metadata were checked; this is not an exhaustive literature review or a full proof audit. The matrix arithmetic was reproduced independently.

This page was generated with AI assistance under AkashicNET’s human editorial direction. Research suggestions are AkashicNET’s proposals, not statements attributed to Hoffman. No affiliation, collaboration or speaker endorsement is implied.

Send a correction or research suggestion · Return to the conference hub