READING PATH
Reality Bit Engine: Millennium-problem routes with their scope stated
What can the programme actually prove on the way to the Riemann Hypothesis, P versus NP and Navier–Stokes, and how can each claim be checked independently with its scope stated?
The engine implements the framework's computable core. Its prize laboratories turn each Millennium target into an explicit missing universal step instead of relabelling finite computation as a solution.
Independently checked
Step 1
What was built. Engine v0.11–v0.12 (4 September): restricted written proofs (Lagarias for integers with at most two prime factors, exact pigeonhole formulas, two fluid obstructions) and a standalone certificate verifier.
What was found. The restricted results held; the verifier rejected all 26 corruptions. The σ(n) ≤ nH_n route failed at n = 12, and 'irrefutable' was declined as exceeding the evidence.
What it opens. A pass aimed at the stated missing arguments.
Independently checked
Step 2
What was built. v0.13: monotonicity and canonical/record reductions for the Lagarias check, a SAT summary-capacity theorem and an amplitude argument for fluid energies.
What was found. Lagarias holds to 10^24 (known method). Constants below γ cannot close the all-integer route; exact one-way equality summaries need 2^n states; no positive-order Sobolev energy is universally monotone.
What it opens. The next release turned to computable fluid certificates.
Independently checked
Step 3
What was built. v0.14–v0.15 (5 September): an all-time small-data certificate from exact Fourier data, then a relative certificate around a large exact shear.
What was found. Small data and small perturbations of a large shear are certified for all time; rejecting a sufficient condition is not evidence of blow-up. A hand calculation's omitted term was caught.
What it opens. v0.15 specifies continuous-time residual and omitted-mode bounds for validating computed trajectories and focuses proof effort there.
Independently checked
Step 4
What was built. v0.16–v0.17: continuous-time residual bounds including omitted modes, affine error envelopes and standalone checkers, then a sharper scalar bound and an 18-mode nonlinear reference.
What was found. Certificates were accepted up to perturbation 0.1. Endpoint-only, retained-mode-only and small-V shortcuts were refuted; perturbation 0.5 stayed unresolved and was frozen as a target.
What it opens. Targeting the frozen perturbation-0.5 failure.
Independently checked
Step 5
What was built. v0.18: residual-directed mode selection, local error caps, a finite-system induction engine and a proof director that checks scope.
What was found. The perturbation-0.5 input is certified for all time; earlier policies stay frozen as failed estimates, and all three universal targets are recorded as open.
What it opens. v0.19's universes and proof bridges.
Independently checked
Step 6
What was built. v0.19–v0.20: finite-system safety by checked SAT certificates, transfer through verified maps, coupled error bounds, then all-word observability and two-sided null-axis probes.
What was found. Exact recovery conditions and ambiguity sets, and written obstructions: reflection symmetry alone does not force critical-line zeros; one-bit local search can stall on satisfiable formulas. All three problems stay open.
What it opens. A circular chain of assumed implications decides nothing; every prize-lab certificate carries its open boundary.
Independently checked
Step 7
What was built. The v0.20.0 README: 101 enumerated capabilities in standard-library C++17 with Python companions, each prize-lab certificate carrying its missing universal step.
What was found. The algebra is executable and finite certificates check, but the engine does not establish seven physical layers, physical quantum hardware, or any prize result.
What it opens. Explicit proof obligations, and the engine version still cited by manuscript 1.97.
- Reality Bit Engine Public
Connected questions
- The Theory of Reality: a projection idea that answers for its evidence →
The engine describes itself as a C++ implementation of Projective Ripple Reality's computable core, and manuscript 1.97 cites Reality Bit Engine 0.20.0. Journey relationship 'Executable state'.
Projective Ripple Reality · Reality Bit Engine · Theory of Reality - RRLS: from a pattern compressor to a closed P versus NP proof gate →
The RE SAT laboratory and the attachment audit are companions to both lines; the engine's SAT prize lab rejects a false near-satisfaction stopping rule. Journey relationship 'Declared operators'.
Applying the RE engine to the structure inside SAT · RRLS: independent mathematical and computational audit · Reality Bit Engine
Where it stands
Editorial guide
Specific periodic fluid inputs, including the perturbation-0.5 shear, carry independently checked all-time certificates. Lagarias is verified only to 10^24; all three universal problems remain open.
Editorial guide