This working paper reframes the previous speculative Riemann Hypothesis brainstorming note into a smaller, testable research program. The empirical question is: Do ordered prime gaps contain measurable compression structure beyond their marginal distribution?
Using the first 20,000 and 100,000 primes, we first compared LZ76 complexity of real prime-gap order against shuffled controls preserving the same multiset. At 100,000 primes, the raw gap encoding produced:
This does not prove RH, but establishes a first compression-detectable signal. Subsequent E2 and SEA partial runs tested stronger controls: block shuffle, wheel-aware shuffle, Markov-preserving surrogates, Cramér-like synthetic gaps, and scaling checks up to 2M primes.
Current SEA finding: the broad E1 shuffle signal is partly explained by local/arithmetic structure, but the raw gap signal survives wheel-aware and Markov-preserving controls at 100k, 1M, and 2M primes. The strongest current line is the 2M Markov-preserving raw gap test: delta −142.34, z −8.76, with 50/50 windows negative.
The original brainstorming paper mixed three levels: empirical observations, reasoned interpretations, and metaphysical speculation. This version separates them. The empirical core is now simple: prime gaps are treated as a sequence, the real order is compared against null models, and MDL/LZ76 decides whether additional structure exists.
Prime gaps \(g_n = p_{n+1} - p_n\) are not independent. Their distribution changes with scale, and primes obey arithmetic constraints. The sharper question is: After preserving basic statistics, does the ordered sequence still compress better than appropriate controls? That is exactly the kind of question the 8Z/MDL/DCC program is built to ask.
DCC balances between seizure (excessive order) and noise (excessive disorder). The original speculative analogy placed Re(s)=1/2 as the edge-of-chaos line. This remains a conceptual analogy, not a proof. The empirical test only asks whether prime gaps show measurable structure under compression tools.
This paper makes no claim to prove the Riemann Hypothesis. It only asserts that ordered prime gaps are more compressible than shuffled controls preserving the same gap distribution. Any bridge to RH remains speculative future motivation.
We generated the first N primes, computed gaps, and applied several encodings (gap, delta, abs_delta, mod6, bucket_log2). Each real ordered window was compared against shuffled controls. The main statistic is \(\Delta_{LZ} = LZ76(real) - mean(LZ76(control))\); a negative value indicates the real sequence is more compressible.
Configuration: 20,000 primes, 30 trials, window 5,000. Summary:
| Encoding | Real LZ76 | Shuffled LZ76 | Delta | Z-score | Interpretation |
|---|---|---|---|---|---|
| gap | 1486.75 | 1579.31 | −92.56 | −22.85 | strong |
| gap_div2 | 1486.75 | 1579.14 | −92.39 | −23.86 | strong |
| delta | 1753.00 | 1820.93 | −67.93 | −16.72 | strong, but needs special control |
| abs_delta | 1520.00 | 1537.62 | −17.62 | −4.44 | moderate/strong |
| mod6 | 714.75 | 882.10 | −167.35 | −88.43 | sanity check; partly expected |
| bucket_log2 | 1045.25 | 1054.22 | −8.97 | −3.92 | weak but present |
Configuration: 100,000 primes, 50 trials, window 10,000. Summary:
| Encoding | Real LZ76 | Shuffled LZ76 | Delta | Z-score | Interpretation |
|---|---|---|---|---|---|
| gap | 2898.80 | 3066.76 | −167.96 | −32.38 | very strong |
| gap_div2 | 2898.80 | 3067.18 | −168.38 | −32.83 | very strong |
| delta | 3395.10 | 3532.89 | −137.79 | −23.90 | very strong, needs control |
| abs_delta | 2959.50 | 3002.05 | −42.55 | −8.25 | strong |
| mod6 | 1281.40 | 1603.32 | −321.92 | −127.43 | sanity check |
| bucket_log2 | 1974.80 | 1984.15 | −9.35 | −3.01 | weak but present |
Raw prime gaps are about 5.5% more compressible in real order than in shuffled order.
Supported: The order of prime gaps carries structure beyond marginal distribution. Not yet shown: that it survives Markov-preserving controls, that it connects to zeta zeros, or that AC/Zero Framework is correct. mod6 is a sanity check; delta needs caution due to lag-1 artifacts.
Minimal success: raw gap outperforms full shuffle, block shuffle, and wheel-aware. Strong success: outperforms Markov surrogates. Very strong: survives all controls and shows scaling growth.
The E2 and SEA runs tested whether the initial shuffle signal survives harder null models and larger prime ranges. The result is positive, but narrower than the first E1 impression. The large shuffle signal is partly local/arithmetic, yet raw prime-gap order survives the most important first-pass controls: wheel-aware and Markov-preserving surrogates.
The current strongest claim is not merely that prime gaps are “non-random.” It is that raw prime-gap order contains compression-detectable sequential structure not fully explained by marginal gap distribution, mod-6 wheel structure, or first-order Markov transitions.
The current partial SEA ZIP includes completed runs:
Missing until the continuation batch completes: 100k wheel6 t2000, 500k Markov/wheel/block replications, and 1M shuffle baseline.
gap summary#| Run | Control | Delta | Z-score | Window result | Reading |
|---|---|---|---|---|---|
| 100k Markov t2000 | Markov | −32.64 | −3.69 | 10/10 negative | survives first-order transitions |
| 100k block50 t1000 | block50 | −14.08 | −2.58 | 10/10 negative | weak but stable |
| 100k block100 t1000 | block100 | −8.70 | −1.63 | 10/10 negative | marginal but directionally stable |
| 1M wheel6 t300 | wheel6 | −31.02 | −4.39 | 50/50 negative | survives mod-6 wheel |
| 1M Markov t300 | Markov | −58.26 | −4.84 | 50/50 negative | survives first-order transitions |
| 1M block50 t300 | block50 | −21.10 | −2.88 | 50/50 negative | medium-scale local survival |
| 1M block100 t300 | block100 | −11.13 | −1.55 | 49/50 negative | weak / marginal |
| 2M Markov t100 | Markov | −142.34 | −8.76 | 50/50 negative | strongest current result |
| 2M wheel6 t100 | wheel6 | −64.42 | −7.01 | 50/50 negative | survives wheel at depth |
Markov survival is now the central result. The 2M Markov run is the strongest current evidence that raw prime-gap order contains structure not fully explained by marginal gap distribution or first-order transition statistics.
Wheel survival is also strong. The 2M wheel6 result shows that the raw gap signal is not merely the trivial \(6k \pm 1\) residue pattern.
Scaling currently looks positive. Markov raw gap results strengthen from 100k to 1M to 2M:
100k Markov: delta −32.64, z −3.69 1M Markov: delta −58.26, z −4.84 2M Markov: delta −142.34, z −8.76
Block tests narrow the claim. Block50 survives weakly/stably, while block100 is marginal. This suggests that much of the signal is local-to-medium scale, but Markov and wheel survival show that the signal is not exhausted by the simplest local controls.
Sensor ranking is now clearer. Raw gap is the primary signal. gap_div2 is effectively the same signal. abs_delta and bucket_log2 should remain diagnostic only; they weaken or flip under harder controls.
Prime-gap order contains a surviving compression signal that is not fully explained by gap distribution, simple wheel residue structure, or first-order Markov transition statistics. The effect is smaller than the initial shuffle result but more meaningful, and the partial SEA results suggest positive scaling up to 2M primes.
The 2M runs currently use only 100 trials, so the permutation p-value resolution is limited. The z-scores and window stability are more informative at this stage. The continuation batch is still needed to complete the 100k wheel replication, 500k bridge, and 1M shuffle baseline.
The first E2/SEA results support number theory as a credible ninth-domain candidate for the 8Z/DCC approach. The strongest current claim is not that DCC proves RH, but that 8Z/DCC compression tools detect a nontrivial order-sensitive signal in prime gaps that survives first-pass wheel-aware and Markov-preserving controls up to 2M primes.
The critical line as edge-of-chaos remains speculative motivation only. Verified: E1 signal. Reasoned: compression advantage suggests order-sensitive structure. Speculative: AC/Zero Framework explanations are not evidence.
This section records the philosophical motivation behind the Zero Framework while keeping it separate from the empirical E1/E2 result. The central issue is not whether mathematics is "wrong." Formal mathematics can define many internally consistent worlds. The stricter question is:
When a formal object is used to describe reality or nature, what exactly is the mapping between the symbol and the thing being described?
In pure mathematics, definitions are allowed to be abstract. A structure can be studied because it is consistent, elegant, or fruitful. In applied mathematics and mathematical physics, however, a formal object earns physical meaning only through a disciplined bridge: what it measures, what it predicts, what it preserves, and where the mapping stops.
This distinction matters for the present paper because RH lives inside pure mathematics, while the 8Z/DCC framing asks a more reality-facing question: whether prime-gap dynamics expose an information structure that can be measured, compressed, and related to deeper arithmetic regularities. The empirical compression tests do not decide ontology. They only ask whether a measurable signal exists.
Standard mathematics treats zero as a single formal object: the additive identity, the result of \(x - x\), and the value attained when a function vanishes. The Zero Framework proposes that ordinary language often mixes two different meanings under the same word:
On this view, a function that equals zero at some point has not "become nothing." It has reached a structured value. A zeta zero is therefore better described as an exact cancellation or destructive-interference point, not an annihilation into non-being.
Analytic continuation is an internally valid and powerful mathematical operation. The concern here is not its consistency. The concern is what happens when a result obtained by extension is presented under the same notation as the original object — without making the substitution explicit.
The Dirichlet series \(\zeta(s) = \sum_{n=1}^{\infty} n^{-s}\) converges for \(\text{Re}(s) > 1\). For \(s = 1\) the harmonic series diverges. For \(s = -1\) the sum \(1 + 2 + 3 + \cdots\) diverges to infinity. Yet analytic continuation assigns \(\zeta(-1) = -\frac{1}{12}\). This is a correct statement about the analytically continued function. But the informal phrase \(1 + 2 + 3 + \cdots = -\frac{1}{12}\) silently substitutes one object for another under the same notation. The two agree where the original sum converges. They are not the same thing where it does not.
The ontological import is this: when the output of an extended object is presented as if it were the output of the original process, the interpretation can carry a hidden metaphysical claim — that the "true value" of a divergent process exists and is reachable by algebraic extension — without stating that claim explicitly or subjecting it to scrutiny. Whether this affects internal consistency is no. Whether it affects what mathematics describes about reality is an open question. This is what we call ontological smuggling: not an error in the proof, but an unacknowledged step in the interpretation.
There are two versions of the Zero Framework critique, and they should not be confused:
The historical analogy is Lobachevsky. For two millennia, Euclid's parallel postulate appeared self-evident — not a choice but a necessity. Replacing it with a different axiom produced a geometry that was equally consistent and turned out to be physically more accurate than the original. The Zero Framework at the axiom level is asking whether the identification \(0 \equiv \text{"nothing"}\) is a parallel postulate of arithmetic: a convenience that has been mistaken for a necessity. The interpretation-level critique is conservative and already useful. The axiom-level critique is speculative but not without historical precedent.
The implication for RH is indirect. RH is a formal statement about the zeros of the analytically continued zeta function. The Zero Framework does not currently change that statement, prove it, or disprove it.
What it may do is sharpen the language around what a zero means. If a zeta zero is treated as a structured cancellation point rather than "nothingness," then the research question becomes cleaner:
What structure forces all nontrivial cancellation points of the zeta function onto the critical line?
That question is still mathematical. The 8Z/DCC contribution, if any, would be to search for measurable information-structure invariants in prime-gap dynamics or prime-counting error that might later connect to the zeta-zero structure.
Current status: interpretation-level critique useful; axiom-level critique unformalized; RH implication speculative. This remains L8 in the interpretation ladder unless a formal invariant is discovered.
Zeta zeros are points of exact cancellation or destructive interference in the analytic structure of the zeta function, not annihilation into ontological nothingness. This correction is an interpretation-level clarification: a function attaining the value zero is not the same as a quantity ceasing to exist.
Ordered prime gaps contain measurable compression structure beyond their marginal distribution. After E2/SEA partial results, the surviving raw-gap signal also exceeds simple wheel-aware and first-order Markov-preserving controls up to 2M primes, though much of the broader signal remains local/arithmetic.
The strongest current thesis is narrower than the original speculation but stronger than the initial shuffle-only result.
Complete the running continuation batch: 100k wheel6 t2000, 500k Markov/wheel/block replications, and 1M shuffle baseline. Then build a sensor-arena summary: raw gap, gap_div2, abs_delta, bucket_log2, and future entropy/compressor sensors across controls, depths, and windows.
E1 delivered a clear shuffle signal. E2 narrowed and strengthened the result. The broad shuffle advantage is partly local/arithmetic, but the raw gap signal survives wheel-aware and Markov-preserving controls, including strong partial SEA results at 1M and 2M primes.
The current conclusion is therefore:
The prime-gap compression signal is real, smaller under harder controls, and still alive where it matters most: raw gap order survives beyond marginal distribution, simple wheel structure, and first-order transition statistics. The partial SEA run adds encouraging scale behavior up to 2M primes.
This is not RH evidence yet, but it is a legitimate 8Z/DCC number-theory signal candidate.
The current compression experiments cannot prove the Riemann Hypothesis. They are empirical signal tests. A proof would require a formal mathematical invariant or theorem that applies to all relevant cases, not only to tested prime ranges.
The useful question is therefore not:
Do prime gaps compress better, therefore RH is true?
That would be invalid. The better question is:
Can compression/DCC analysis help discover a formal invariant that forbids off-critical-line zeros?
A possible proof path would need the following form:
In short:
empirical signal → formal invariant → equivalence/implication → proof
One possible route is through prime-counting error. RH is deeply connected to how tightly prime-counting functions stay near their expected main terms. A compression-based approach would need to discover a bound or regularity in the prime-gap trace that implies an appropriate bound on prime-counting error.
A rough proof-seed form would be:
If every prime-gap window has bounded normalized MDL excess, then prime-counting error remains within an RH-compatible bound.
This is not yet a theorem. It is a target shape for future formalization.
The most RH-adjacent route would connect compression structure in prime gaps to the oscillatory terms generated by zeta zeros in explicit formulas. In that direction, the desired contradiction would look like this:
Symbolically:
off-line zero → forbidden oscillation/compression signature → contradiction → RH
Another route is discovery of a new RH-equivalent condition. 8Z/DCC could search for a new boundedness, monotonicity, spectral, or compression condition that appears empirically stable. The mathematical task would then be:
This may be more realistic than directly proving statements about zeta zeros from compression data.
| Phase | Goal | Status |
|---|---|---|
| 1 | Detect empirical signal in prime-gap order | started; E1 positive |
| 2 | Test signal against stronger null controls | first E2/SEA pass positive; deeper tests needed |
| 3 | Build multi-scale MDL/compression spectrum | planned |
| 4 | Relate spectrum to prime-counting error or explicit-formula terms | planned |
| 5 | Extract candidate invariant | future |
| 6 | Prove invariant and RH implication/equivalence | future |
| 7 | Formal verification where possible | future |
The current strongest honest formulation is:
8Z/DCC may help discover a new RH-adjacent regularity by treating prime gaps as a multi-scale information trace and searching for stable compression invariants that bound or constrain prime-distribution error.
This keeps the door open without pretending that E1 or E2 can prove RH by themselves.
Tables are shown in Section 6 above.
| Level | Claim | Status |
|---|---|---|
| L1 | Prime-gap order compresses better than shuffled gaps | ✅ supported by E1 |
| L2 | Signal is not only marginal distribution | ✅ supported by E1 |
| L3 | Signal survives wheel-aware controls | ✅ supported by first E2/SEA pass |
| L4 | Signal survives Markov-preserving controls | ✅ supported by first E2/SEA pass |
| L5 | Signal scales with prime depth | ◐ partially supported up to 2M; needs deeper tests |
| L6 | Signal relates to zeta-zero statistics | 🔮 speculative |
| L7 | DCC edge-of-chaos explains critical line | 🔮 speculative |
| L8 | AC/Zero Framework explains RH truth/proof difficulty | 🔮 highly speculative |
Use: “compression-detectable structure”, “order-sensitive signal”, “preliminary empirical result”, “null controls”, “not an RH proof”. Avoid: “RH confirmed”, “proof”, “annihilation of zeta zeros”, “AC requires RH”.
For each analysis window independently, the exact multiset of gap tokens inside that window is shuffled. This preserves the local gap distribution of that window and destroys only the ordering inside the window.
This matters because the E1 claim is not that prime gaps have a special distribution. The claim is narrower: the real order of those same gaps is more compressible than shuffled order.
These are non-overlapping main windows in the reported E1 runs. Later E2/E3 runs may add overlapping or depth-specific windows, but those should be reported separately.
Each encoding maps the prime-gap sequence into a token sequence before LZ76 is computed:
gap: raw integer prime-gap values.gap_div2: normalized even gap values after the initial special case.delta: first difference, \(g_{n+1} - g_n\).abs_delta: absolute first difference, \(|g_{n+1} - g_n|\).mod6: gap values modulo 6.bucket_log2: logarithmic bucket encoding of gap size.The primary statistic is:
Delta_LZ = LZ76(real) - mean(LZ76(control))
A negative value means the real ordered sequence is more compressible than the control sequences.
The permutation p-value is computed as:
p = (1 + count(control_LZ <= real_LZ)) / (trials + 1)
With 50 trials, the minimum possible p-value is \(1/51 \approx 0.0196\). Therefore, the E1 p-values should be read as “the real sequence beat all sampled controls,” not as a final high-resolution significance estimate.
The E1 compression advantage may partly reflect known arithmetic constraints and scale effects, including:
This is why E2 adds block, wheel-aware, Markov-preserving, Cramér-like, and depth/scaling controls. The purpose is to separate obvious arithmetic structure from deeper sequential compression structure.
The current result is a first-pass E2/SEA signal, not a final theorem. It defeats full shuffle, first-pass wheel-aware, and first-pass Markov-preserving controls for raw gap, including strong 1M/2M partial results. It still needs the missing continuation runs, deeper scaling, more seeds, improved surrogate validation, full window-level plots, and a sensor-arena leaderboard.
Next: Add the continuation-batch results, full per-control CSV/JSON audit tables, window-level depth plots, and a sensor leaderboard. If the 500k/1M/2M pattern remains stable, the paper advances to v0.6 with a dedicated multi-scale signal-arena section.
Version 0.5 · May 2, 2026 · Working HTML page · Built on v0.4.3 hybrid base · E2/SEA partial results added · Raw gap survives wheel-aware and Markov-preserving controls up to 2M primes · Next: v0.6 after continuation-batch completion and sensor-arena summary.