0 flips · 0 restarts · 0 ms
Physics | Information | Optimisation
One method, taken across fields.
Falsifiable ideas carried between disciplines usually kept apart - with the receipts to check them.
Independent, DOI-backed research.
Quantum Genesis
Three Dimensions for One Bit, and Dark Energy as Fast Time
Pressure builds space, records make time, and the Record-Carrier Expansion Law fixes the curve.
Quantum–Classical Bridges Exist
Exact Finite Constructions from Quantum Sources through Classical Records to Quantum Control, Noncommuting Responses, and Full-History Dynamics
A finite constructive bridge from a first informative bit to accessible classical fact, durable quantum records, operational time, and later record-controlled quantum dynamics.
From the First Bit to the Birth of Time
A Discrete Pre-Geometric Foundation for Quantum Mechanics Through One-, Two-, and Three-Dimensional Stages, Durable Quantum Records, Two Operational Event Clocks, and Record-Controlled Dynamics
An exact finite lifecycle from the first informative distinction through one-, two-, and three-dimensional formation to durable quantum records, two operational event clocks, and record-controlled dynamics.
Solver Race
Live browser race with native C11-to-WebAssembly solver import.
- Status
- READY
- Lanes settled
- 0/4
- Elapsed
- 00:00.0
Live race console
Planted 3-CNF | 24 variables | 96 clauses
0 flips · 0 restarts · 0 ms
0 flips · 0 restarts · 0 ms
0 flips · 0 restarts · 0 ms
Public browser race initialized. Local files stay in this browser; library instances load from this site only when selected.
Choose an instance, import a C solver if wanted, then run the race.
Ready. Choose an instance and run the selected public lanes.
Published research
Zenodo publications
Thirteen DOI-backed independent publications.
The three pillars
Dark Energy Is a Rate, Not a Substance
Time runs faster in emptier space. A fixed fast-time expansion history against audited DESI DR2 + Pantheon+ data.
10.5281/zenodo.21744882Pillar IIThree Dimensions from a One-Bit Budget
A termination theorem for pregeometric ladders: an exact budget-to-terminal-rank law.
10.5281/zenodo.21938162Pillar IIIOne Bit, Two Sides, Three Theorems
Records, hinges, and mirror-paired transitions - the finite theory before geometry supplies distance.
10.5281/zenodo.21961046Further deposits
Square-Free Centered Squares, Negative Pell Fibers, and Lucas Recurrences
A complete Pell–Lucas classification of the square-free kernels of centered squares, with explicit recurrences and density.
10.5281/zenodo.21876080CosmologyDark Energy Is Fast Time
The broader fast-time mechanism, Free-Time Logistic Transport Law, environmental bridge, and public-data tests.
10.5281/zenodo.21301839Formation theoremTimeless 2D Formation, Executed 3D Transition, and the Birth of Physical Time
An exact finite-pregeometry theorem connecting timeless 2D formation, an executed 3D transition, and the first physical ordering with record capacity.
10.5281/zenodo.22043115Registered predictionGravitational-Wave Two-Peak Ratio
Pre-registered, parameter-free frequency-ratio prediction of the stochastic background.
10.5281/zenodo.21172955Cross-fieldThe Silver Web
A carrier-capacity correspondence from FK/Tutte structure to modular capacity.
10.5281/zenodo.21746428Exact theoremFinite-Binary Möbius Conjugate-Response Law
Gibbs certification and all-order Hamiltonian reconstruction in correlated binary equilibrium.
10.5281/zenodo.21745774InstrumentThe Möbius-Obstruction Instrument
Response surfaces to irreducible supports and minimal interventions, with a finite proof of operation.
10.5281/zenodo.21745631Navigate the programme
Explore
Atlases & Codex
Möbius · Crystal · Silver Web · Paradox · Solver - structured maps of whole research territories.
Public catalogueFree tools
Source-available kernels, browser solver demonstrations and verifiers, with licences and reproducibility materials included.
Your solver
Bring a C11 solver to the race. It compiles to WebAssembly locally, runs in a fresh worker and receives an independently checked result.
Structured reference works
Atlases & Compendia
Where a paper argues one claim, an atlas maps a territory: its objects, invariants, relations and reusable methods.
Möbius Atlas
A fixed-parent method for decomposing finite subset observables into their irreducible supports, controls and response structure.
Open research record ↗Crystal Codex
A ranked, reproducible map of crystal-structure findings, prior art and the tests that distinguish them.
Silver Web Atlas
A cross-field carrier-capacity reference work, with its objects, correspondences and reproduction harness.
Open research record ↗Paradox Atlas
A public computational map and taxonomy covering all 175 Atlas entries across 12 sections, with explicit evidence limits and reproducible checksums.
Download public map ↓Solver Atlas
A structured reference to optimisation techniques, their operating domains and transferable design patterns.
Security Atlas
A specialist reference supporting proprietary robustness, security and systems work.
Combinatorial optimisation infrastructure
Solvers
A long-running line of specialised C++ stochastic local-search engines developed against difficult combinatorial instances. Specialised engine access is offered as a service, while selected research infrastructure is available publicly.
Black-box solver service
Submit an instance and receive a result and certificate. The specialised production engines remain behind the endpoint.
Solver Race
Compare the public browser lanes and imported C11 solvers on supplied fixtures, local files or the positive benchmark library, with live metrics and independently checked assignments.
Public research software
Free tools
Compact kernels, solver demonstrations and verifiers for local inspection and reproducible testing. Downloadable packages are source-available under a noncommercial licence.
Tiny Core Kernel
A compact deterministic three-register mixer for study, experiments and reproducible trace identifiers.
View package →Solver Race Public Lanes
Four live reference lanes plus real local C11-to-WebAssembly import, live progress and independently checked assignments.
Open the race ↑Paradox SLS
A Python and C11 paradox-scored local-search demonstrator with a deterministic verification suite.
View package →Mechanism Verifier
The verifier shipped with the one-bit-budget paper: 1,230 offline standard-library checks with stored expected output.
View details →About
Independent research.
I am an independent researcher based in Australia, with a background in AI-systems engineering and multi-agent systems. I apply that experience to mathematical physics, cosmology, information theory and combinatorial optimisation.
The method is direct: identify a falsifiable claim, state its premises, and push the derivation or computation until the result is exact and reproducible. Computational work is released with source, hash-pinned inputs and a verifier wherever the claim supports one.
Working principles
- Falsifiable claims first.
- Reproducible by default.
- Ambitious scope, explicit premises.