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.

Live in your browser

Solver Race

Live browser race with native C11-to-WebAssembly solver import.

Local / READY
Race Control4 participants
Status
READY
Lanes settled
0/4
Elapsed
00:00.0

Live race console

Planted 3-CNF | 24 variables | 96 clauses

Entries 2Verified 0
GreedyIDLE

0 flips · 0 restarts · 0 ms

FocusedIDLE

0 flips · 0 restarts · 0 ms

Random walkIDLE

0 flips · 0 restarts · 0 ms

Repeat-awareIDLE

0 flips · 0 restarts · 0 ms

[SYSTEM]

Public browser race initialized. Local files stay in this browser; library instances load from this site only when selected.

[READY]

Choose an instance, import a C solver if wanted, then run the race.

Witness check: activeEvery returned assignment is independently verifiedLocal files stay in browser
Positive benchmark collection

Competition CNF library

5,346 instances · 20–2,000 variables · one file fetched only after Load

Positive-instance scope. Other archive categories are excluded. Every returned assignment is checked against the selected formula before acceptance. Provenance and scope

Showing 0 of 0 matches

No instance matches the current filters.

Ready. Choose an instance and run the selected public lanes.

Published research

Zenodo publications

Thirteen DOI-backed independent publications.

The three pillars

Further deposits

Navigate the programme

Explore

13open deposits, DOI-backed
1,230automated checks in the one-bit verifier
3 + 3flagship works and pillars
Sourceand reproducibility materials across the published programme

Structured reference works

Atlases & Compendia

Where a paper argues one claim, an atlas maps a territory: its objects, invariants, relations and reusable methods.

Reference atlas33 capsules

Möbius Atlas

A fixed-parent method for decomposing finite subset observables into their irreducible supports, controls and response structure.

Open research record ↗
Research codex16 findings

Crystal Codex

A ranked, reproducible map of crystal-structure findings, prior art and the tests that distinguish them.

Cross-field atlas7,544 lines

Silver Web Atlas

A cross-field carrier-capacity reference work, with its objects, correspondences and reproduction harness.

Open research record ↗
Public reference175 entries

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 ↓
Technique atlasTechnique reference

Solver Atlas

A structured reference to optimisation techniques, their operating domains and transferable design patterns.

Specialist referenceSecurity systems

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.

Private access

Black-box solver service

Submit an instance and receive a result and certificate. The specialised production engines remain behind the endpoint.

Live on this page

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.

Downloadable

Tiny Core Kernel

A compact deterministic three-register mixer for study, experiments and reproducible trace identifiers.

View package →
Run here

Solver Race Public Lanes

Four live reference lanes plus real local C11-to-WebAssembly import, live progress and independently checked assignments.

Open the race ↑
Python + C11

Paradox SLS

A Python and C11 paradox-scored local-search demonstrator with a deterministic verification suite.

View package →
Available

Mechanism Verifier

The verifier shipped with the one-bit-budget paper: 1,230 offline standard-library checks with stored expected output.

View details →
Browse all free tools →

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.