TIME, CAPACITY, AND THE SELF-VERIFYING MACHINE

Three sentences. First: time is not a container in which systems live; every substrate has a finite ordering capacity per unit of its own time, and what a system can compute, remember, and experience is set by that capacity. I state this as a law (λ ≤ σ) and I measure it. Second: on today's quantum computers this law is not philosophy - it is a measured curve with a collapse edge, and software that respects the law makes machines predictable and better: 96 preregistered head-to-head wins against the vendors' own toolchains, sealed cross-chip forecasts with 1.6-point mean error, coherence extended 3.4-fold under artifact control. Third: the same law is substrate-independent - the next fields are AI models (hallucination as capacity overload) and brains (the sampling rate of consciousness), and the far end of this program treats time itself as a resource to be read, budgeted, and navigated. Who wrote this: a founder without a physics degree, twenty years in financial markets, working alone with a MacBook and cloud access to quantum hardware. I am aware of how that sounds. It is precisely why every number in this document was produced under preregistration. Endpoints fixed in writing before submission, wins and losses both counted, official job IDs on everything. You are not asked to believe a word here. You are asked to recompute it.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-08-24
DOI
https://doi.org/10.5281/zenodo.22078283
Primary Topic
Quantum Mechanics and Applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

TIME, CAPACITY, AND THE SELF-VERIFYING MACHINE

Raffael Kasprzak
Zenodo (CERN European Organization for Nuclear Research)
Quantum Mechanics and Applications
preprint

TIME, CAPACITY, AND THE SELF-VERIFYING MACHINE

Raffael Kasprzak
preprint en

Abstract

Three sentences. First: time is not a container in which systems live; every substrate has a finite ordering capacity per unit of its own time, and what a system can compute, remember, and experience is set by that capacity. I state this as a law (λ ≤ σ) and I measure it. Second: on today's quantum computers this law is not philosophy - it is a measured curve with a collapse edge, and software that respects the law makes machines predictable and better: 96 preregistered head-to-head wins against the vendors' own toolchains, sealed cross-chip forecasts with 1.6-point mean error, coherence extended 3.4-fold under artifact control. Third: the same law is substrate-independent - the next fields are AI models (hallucination as capacity overload) and brains (the sampling rate of consciousness), and the far end of this program treats time itself as a resource to be read, budgeted, and navigated. Who wrote this: a founder without a physics degree, twenty years in financial markets, working alone with a MacBook and cloud access to quantum hardware. I am aware of how that sounds. It is precisely why every number in this document was produced under preregistration. Endpoints fixed in writing before submission, wins and losses both counted, official job IDs on everything. You are not asked to believe a word here. You are asked to recompute it.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Quantum Mechanics and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.