One method, taken across fields.
Single falsifiable ideas carried between disciplines usually kept apart — with the receipts to check them.
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.
10.5281/zenodo.21744228Zenodo publications
The three pillars
Pillar IDark 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.21744882 Pillar IIThree Dimensions from a One-Bit Budget
A termination theorem for pregeometric ladders: an exact budget-to-terminal-rank law.
10.5281/zenodo.21938162 Pillar IIIOne Bit, Two Sides, Three Theorems
Records, hinges, and mirror-paired transitions — the finite theory before geometry supplies distance.
10.5281/zenodo.21961046Further deposits
Registered predictionGravitational-Wave Two-Peak Ratio
Pre-registered, parameter-free frequency-ratio prediction of the stochastic background.
10.5281/zenodo.21172955 Cross-fieldThe Silver Web
A carrier–capacity correspondence from FK/Tutte structure to modular capacity.
10.5281/zenodo.21746428 Exact theoremFinite-Binary Möbius Conjugate-Response Law
Gibbs certification and all-order Hamiltonian reconstruction in correlated binary equilibrium.
10.5281/zenodo.21745774 InstrumentThe Möbius–Obstruction Instrument
Response surfaces to irreducible supports and minimal interventions, with a finite proof of operation.
10.5281/zenodo.21745631 Paper pages & abstracts → All deposits & version history →Solver Race
φ = ⋀ᵢ Cᵢ — real solvers running in this page, right now.
Honesty rule: only a complete solver that finishes may claim UNSAT. A local-search failure is UNKNOWN — never a proof. Solvers run off-thread in Web Workers; Stop terminates them instantly.
Explore
ReferenceAtlases & Codex
Möbius · Crystal · Silver Web — systematic, verifier-backed maps of whole territories.
RegisterParadoxes
Named contradictions, their sharpest statements, and which resolutions actually compute.
Being packagedFree tools
Verifiers and utilities from the research line, packaged for public use.
Your solver
Bring your engine to the race. Local run first; result submission lands with the upload lane.
Paradoxes
where the standard account contradicts itselfA paradox is a debugging signal. When two well-established lines of reasoning reach incompatible conclusions, at least one carries a hidden premise — and locating that premise usually teaches more than either conclusion did. This section collects the ones I work on: the exact statement of the tension, what each side actually assumes, and where the contradiction resolves or provably does not.
The register
A catalogue of paradoxes stated precisely enough to be worked on — each with its premises made explicit, its carriers typed, and the specific step where the two arguments diverge. Stated first, resolved second: a clean statement of the tension is itself the deliverable.
Resolutions and no-gos
Where the analysis closes, the resolution is published with the argument that forces it. Where it does not, the obstruction is published instead — a proof that no resolution of a given shape can exist is a result, not a failure, and is recorded as one.
Atlases & Compendia
structured reference worksWhere a paper argues one claim, an atlas maps a whole territory. Each atlas is a systematic, browsable reference: the objects, their invariants, the relations between them, and the boundaries where the structure stops. Built from the same reproducible pipeline as the papers — every entry traceable to the computation that produced it.
Möbius Atlas
A cross-field method — fix one parent system, declare the observable, and read the Möbius atoms Δ(S) = ΣT⊆S(−1)|S|−|T|F(T) — applied across thirty-three capsules: stabiliser/QEC entropy, holographic min-cut capacity, Harsanyi dividends and ML feature interaction, percolation and TDA, causal sets, information synergy, genetic epistasis, alloy cluster expansion, reliability and cascade networks. Every capsule is a minimum reproducible witness with its controls, and each carries an explicit carry-forward grade.
Crystal Codex
Sixteen findings on crystals, liquid crystals, active nematics and quasicrystals, each ranked by carry-forward value and graded honestly from conclusive to mixed: periodic parents that predict allowed waves, crystallographic restriction as a hard symmetry gate, Reynolds-projection residuals that detect symmetry breaking, defect-interaction atoms, Burgers/Frank holonomy calibration, Frank elasticity and Q-tensor anchors, hidden-parent selectors for quasicrystals, and fracton-elasticity tensor gauge.
Silver Web Atlas
The carrier–capacity correspondence in full, across twenty sections: the capacity-of-entanglement operational closure, the pressure/logit and Möbius carrier bridge, and the observable-discriminator campaign — closing with a unified claim ledger and an explicit publication firewall. It ships as a standalone bundle that re-derives its own numbers: twenty-three Python blocks and one Lean block extracted verbatim, with every result captured and re-runnable.
Solver Atlas
Tensor and biological solver families mapped as one compendium, built on a complete technique reference for satisfiability: conflict-driven clause learning, stochastic local search, clause management, branching and restart heuristics, preprocessing and portfolio strategy — organised by which structures each method actually reaches. Method-level throughout. The production solver implementations are deliberately not included.
Security Atlas
Compiled and held privately. Not published, and not scheduled for release — this entry exists so the compendium's scope is stated honestly rather than silently trimmed.
Solvers
combinatorial optimisation infrastructureA long-running line of stochastic local-search solvers written in C++, developed and benchmarked over years against hard combinatorial instances. The implementations are proprietary; access is offered as a service, and the surrounding infrastructure is open.
Black-box solver service
Submit an instance, receive a result. The production stochastic local-search engines run behind the endpoint — you get the solution and the certificate, not the source. Intended for problems where a general-purpose solver stalls and a specialised one does not.
Solver Race
The public arena is open above: complete and local-search engines racing on SATLIB instances, in your browser, under an honest verdict discipline. Bring-your-own-solver submission is the next lane.
Free tools
a sample — full set on Event HorizonSmall, self-contained utilities built while doing the research and released because they turned out useful on their own. This page carries a sample; the fuller collection lives on the Event Horizon side.
Mechanism verifier
AvailableThe verifier shipped with the one-bit-budget paper: 1,230 automated checks over the theorem's arithmetic, with a stored expected output to diff against. Runs offline with no dependencies beyond the standard library. Included in the deposit.
More tools
Being packagedFurther utilities are being cleaned up for release. Listed here as they land, rather than announced before they work.
AI stress testing
Event HorizonAdversarial evaluation of AI systems — failure-mode discovery, robustness probing and stress harnesses — is commercial work and lives on the Event Horizon Enterprises side, not here.
About
I work independently, from Sydney, Australia. My background is in AI-systems engineering — designing and running multi-agent systems that do real research work — and I apply that capability to problems in mathematical physics, cosmology, information theory and combinatorial optimisation.
The method is deliberately narrow: take one claim that could be wrong, state the premises it needs, and push it until it either holds exactly or breaks. Results are published with the machinery that produced them, so the reader can check rather than trust — source, hash-pinned inputs, and a verifier wherever the claim is computational.
Working principles
Falsifiable or it doesn't ship. Every claim states the premises it rests on.
Reproducible by default. Source, data hashes and verifiers travel with the result.
Scope stated honestly. What a result does not establish is written down
next to what it does.