0 / 2,048
no run yet
The Number Seam | one machine, one measure
The Bits That Have Not Arrived
This is not the value of a universal constant. It is a halting measure attached to the specific universal self-delimiting register machine used by Cristian Calude, Michael Dinneen, and Chi-Kou Shu in 2002. First make a lower bound move. Then audit the carry that separates digits you can see from bits you can prove.
Omega_U = sum over halting p of 2-|p|
Fair independent bits feed one fixed prefix-free machine. A minimal halting input of length |p| owns a cylinder of measure 2-|p|. Prefix-freeness makes those cylinders disjoint. Change the machine or its encoding and the number changes.
Layer 1 | the lower tide
A halt adds weight. A timeout adds nothing.
The fleet below contains every eleven-bit data word attached to one canonical compressed register program. The parser reads the paper's seven-bit ASCII instruction format. Press Run. The programs advance in instruction rounds, and each witnessed halt adds its cylinder weight to an exact rational lower bound.
2,048 curated inputs, one shared instruction skeletonready
Moving right can reveal more halts. It can never revoke one. A program still running at the cutoff stays unresolved.
Witnessed halts
Exact lower bound added
0
waiting for a witnessed halt
Prefix audit
not run
binary Patricia trie not built
This fleet is a laboratory sample, not an enumeration of the 2002 paper's millions of programs. Its lower bound is true for the same instruction conventions, but none of its displayed zero digits is thereby certified as a bit of Omega.
Layer 2 | the carry audit
The dismissal is right. Now close the interval.
Running more programs only approaches Omega from below. An unseen halt can add mass far to the right and carry left through provisional digits. The 2002 result did something stronger: it classified programs through length 84, bounded every longer contribution with two geometric series, and put the true value inside an interval whose endpoints share a prefix.
The 2002 certificate, reconstructed with exact integers64 bits certified
| Use row | Length | Halting count | Contribution |
|---|
Accepted lower numerator over 2^84
building
Residual upper width
building
Common leading prefix
building
computed by comparing exact rational endpoint floors
same throughout the intervalvisible in the lower endpoint, vulnerable to carry
The twelve published halting counts are evidence inputs. The browser recomputes their Kraft sum. At the published settings it also reduces the two infinite tails to exact fractions and independently discovers the common prefix. Withhold a row, enlarge the tail, or remove either proof class. The meter does not negotiate.
Layer 3 | the open edge
The theorem is closed. The next certificate is not supplied.
For every fixed universal prefix-free machine, Omega is left-computably enumerable, algorithmically random, and uncomputable. That asymptotic question is settled. For this exact 2002 machine, the source certifies 64 initial bits. A peer-reviewed extension of that same prefix: we could not find this as of 2026-08-01. This is a literature-status uncertainty, not a proof that bit 65 is presently unknown to everyone.
The nearest concrete challenge is therefore exact and machine-specific: give a checked classification and residual-mass bound narrow enough to fix the next bit. The 2007 result does not extend this prefix. It certifies 43 bits for a base-16 data machine and 40 for a base-2 data machine, two different halting measures.
Exact first bits of this same machine would decide halting for its inputs up to the matching length. They do not answer every program in every language for free. Translation into this machine costs bits, and the overhead must be counted.
The check
Recomputing the shipped engine.
- Fixed machine: the 2002 compressed canonical register machine, with seven-bit ASCII characters, one final HALT instruction, and data consumed exactly. This free choice determines the number.
- Layer 1 free choices: one generated instruction skeleton, all eleven-bit data words, a user-selected finite instruction cutoff, and a compressed Patricia representation for the prefix audit. A timeout is unresolved, never nonhalting.
- Transcribed evidence: twelve halting counts through 84 bits and the two length-84 prefix counts from Calude, Dinneen, and Shu. This page checks their arithmetic consequences. It did not rerun their 2,559,837 halting classifications or their mathematical nonhalting proofs.
- Tail convention: lengths 91 and above are bounded by the paper's two closed geometric series. The slider deliberately multiplies that bound. Removing a proof class sets the usable upper endpoint to 1 because this reconstruction then has no replacement bound.
- Binary convention: bits follow the ordinary base-two fractional expansion. Endpoint comparisons use exact BigInt rational floors, with no floating-point decision.
- Literature cutoff: source status was checked through 2026-08-01. Absence of a located extension is not evidence of impossibility.