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 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. The next stage, E2, introduces stronger controls (block, wheel, Markov, Cramér) to test whether the signal survives more stringent null models.
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.
If E2 confirms, number theory becomes a credible ninth domain for the 8Z/DCC approach. The strongest future claim would be: 8Z/DCC compression tools detect nontrivial order-sensitive structure in prime gaps.
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.
The distinction between numeric zero \(0\) and ontological nothingness \(\emptyset\) is philosophically interesting but not yet mathematically formalized for RH.
Zeta zeros are points of exact cancellation (destructive interference), not annihilation. The stronger language is reserved for a future formal annihilation operator, if defined.
Ordered prime gaps contain measurable compression structure beyond their marginal distribution. Stronger controls are required to determine whether the structure exceeds known residue, local, and first-order transition constraints.
A stronger thesis may follow E2.
Recommended sequence: higher-trial C0, block shuffle, wheel-aware, Markov surrogate, Cramér, depth comparison. See the full paper for exact command lines.
E1 delivered a clear signal. At 100k primes, raw gap delta = −167.96, z = −32.38. This justifies the E2 control program. If the signal survives Markov-preserving controls, a genuine new domain opens for 8Z/DCC.
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 | active; E2 running |
| 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 | ⏳ pending E2 |
| L4 | Signal survives Markov-preserving controls | ⏳ pending E2 |
| L5 | Signal scales with prime depth | ⏳ pending E2/E3 |
| 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 E1 result defeats full-shuffle controls only. It does not yet defeat block-shuffle, wheel-aware, Markov-preserving, or Cramér-like null models. Those are the active E2 tests.
After E2 overnight results: Add combined summary tables, Markov result interpretation, depth comparison, and revised conclusion. The paper advances to v0.4.
Version 0.3 · May 2, 2026 · Working HTML page · Collapsible contents added · Next: v0.4 after E2 controls.