Job #1393 — Leads: new statistic
Rung split, first, because this return mixes two kinds of work. §2 is a design
(conjectured; no value of the statistic has been computed). §5 is measured:
an exact finite computation, reproduced by a served script with its output hash
below. Nothing here changes any OPEN status, and no novelty is claimed for the
statistic. The return is filed as measure rung on the strength of §5 alone; the
design is the deliverable, not a claim about Möbius.
1. What the retained censuses could not do (the gap)
research/singleton-fiber-audit.md (Q-singleton-fiber-audit) proves, from named
classical inputs, that each sign's ungrouped singleton mass satisfies
P₁(x) ≥ c·x·log x and N₁(x) ≥ c·x·log x eventually, and states plainly that "the
signed singleton and longer-fiber contributions remain OPEN". Those two inequalities
bound P₁ and N₁ separately, from below; two quantities each exceeding c·x·log x
admit any signed difference in [−(P₁+N₁), P₁+N₁]. They therefore decide nothing
about R₁ = P₁ − N₁, its size or its sign. That is the gap.
research/corner-measurement.md (Q-corner-measurement) is the programme's previous
attempt at a signed finite statistic (for the corner, not the singleton) and its
leading result is disconfirming for the measurement: at every reachable x the
actual right band (⌊x^(1/20)⌋, ⌊(x−2)/(E₁+1)⌋] contains at most one prime and is
empty at several dyadic blocks, so the actual-parameter rows measure "a one-prime
object rather than the asymptotic corner". research/kernel-sign-control.md is the
other attempt and found its regime dominated by a class where the kernel is
invisible — "a failure to detect, not a refutation". A new statistic must therefore
be admissible at reachable x; §5 measures that it is.
2. The statistic (design; conjectured)
Cutoffs and the partition are read unchanged from the audit §1: U = V = ⌊x^(6/25)⌋, Y = Z = ⌊x^(1/20)⌋, J_x = (x/2, x] ∩ ℤ, β_W(m) = Σ_{r|m, r>W, r prime} log r, and over the fibers I_{k,v} = {(d,e) ∈ ℕ² : d>U, e>Y, dk−ev=2, dk ∈ J_x},
P₁ = Σ_{|I_{k,v}|=1} 1[μ(d)μ(e)=+1] β_V(k)β_Z(v),
N₁ = Σ_{|I_{k,v}|=1} 1[μ(d)μ(e)=−1] β_V(k)β_Z(v),
R₁ = P₁ − N₁, M = P₁ + N₁, Σw² = Σ_{|I_{k,v}|=1} (β_V(k)β_Z(v))²,
S(x) = R₁(x) / sqrt(Σw²(x)), ρ(x) = |R₁(x)| / M(x).
S is the signed sum normalised by its exact random-sign null standard deviation —
the object corner-measurement.md §2 calls "the exact second-moment standard deviation
sqrt(sum w²)". Under the random-sign null S has mean 0 and variance 1 by construction,
so |S| ≤ 2 is a pre-declarable null band and no simulation is needed to read it; the
seeded draws check the normalisation rather than replace it.
Decision informed. Whether the signed singleton remainder carries arithmetic structure — cancellation below the random-sign null — at a scale a run can compute. That is the only kind of finite evidence that can support or undercut the heuristic that E_⧫ is payable, and it is exactly the input the audit leaves OPEN. A null reading is itself a decision: it removes an anticipated piece of support.
3. Pre-registered falsifier — fixed before any run
- F1. If |S(x)| ≤ 2 for every admissible dyadic block x ≤ X_max, the statistic is consistent with the random-sign null at every scale reached; the report says "no detectable signed structure" first, claims no support for cancellation, and does not report a rate.
- F2. Fit s = d log(|R₁|/M) / d log x over the admissible blocks. If s ≥ 0 within the
spread of the control, no heuristic support for cancellation is claimed. If s < 0 the
reading is "consistent with" at most, and s is compared with the control's own decay:
a random-sign sum of N terms decays like N^(−1/2) relative to its mass, so a decay no
faster than the control's is not evidence of arithmetic structure. (F2 is
corner-measurement.md§2's pre-registered rule reused verbatim; re-deriving a weaker one would be a defect.) - F3. sign(R₁(x)) is pre-registered per block; block signs unbalanced beyond the control's spread are reported as anti-cancellation, not summarised away.
- F4 (admissibility). A block is admissible only if its right weight is non-zero on more than one n in the block. Inadmissible blocks are reported and excluded, never silently averaged in — the failure mode §5 shows the corner statistic cannot avoid.
4. Matched control
(i) Random-sign: 16 seeded draws replacing μ(d)μ(e) by ±1 equiprobably while
preserving every magnitude — the repo's own control; mean must lie within a few standard
errors of 0 and the sd within a few percent of 1, else the run stops. (ii) Independent
thinning: keep each term independently with probability 1/2; the null predicts E[S] = 0,
sd(S) = 1 at every level. (iii) Negative control: empty the e > Y band ⇒ no singleton
fiber, R₁ = 0 and S = 0 with zero contributing terms (reused verbatim from
corner-measurement.md's pre-registered control (iv)).
5. Admissibility: measured here (the new finite result)
The two proposals differ in kind, and that is the design's whole claim:
- corner statistic: needs a prime in the narrow interval (⌊x^(1/20)⌋, ⌊(x−2)/(E₁+1)⌋] with E₁ = ⌊x^(93/100)⌋ — a band condition;
- this statistic: needs a prime factor above ⌊x^(1/20)⌋ in the cofactor v — a support condition.
new-statistic-degeneracy.js computes both exactly for dyadic x by smallest-prime-factor
sieving and integer root arithmetic only (no floating-point decision is taken on an
integer condition). Run: 1.83 s wall, peak 111 MB, single core, under the Windows job
object at --timeout 300 --mem-mb 2048 --cpu-s 240 with the limit states recorded
enforced.
| x | (A) primes in corner band | (A) admissible | (B) v ∈ (x/2,x] with a prime factor > ⌊x^(1/20)⌋ | (B) admissible |
|---|---|---|---|---|
| 2²⁰ | 0 | no (band empty) | 524287 / 524288 = 0.999998093 | yes |
| 2²² | 0 | no (band empty) | 2097151 / 2097152 = 0.999999523 | yes |
| 2²⁴ | 1 (the prime 3) | no (one-prime object) | 8388607 / 8388608 = 0.999999881 | yes |
| 2³⁰ | 1 (the prime 3) | no | not computed (above the exact-sieve range) | — |
| 2³⁶ | 1 (the prime 5) | no | not computed | — |
The single inadmissible cofactor in each block is the top power of two (v = x, largest
prime factor 2) — precisely the one v with no prime factor above ⌊x^(1/20)⌋ = 2. So the
singleton criterion fails on one integer per block where the corner criterion fails on
all of them. This reproduces corner-measurement.md §3 independently (the band holds
≤ 1 prime, empty at 2²⁰ and 2²²) and shows the degeneracy is a property of the band
condition, not of scale.
Beyond the exact rows the claim is stated qualitatively and marked as such: for Z = x^(1/20), the v ≤ x with no prime factor above Z are the Z-smooth integers, counted by Ψ(x, x^(1/20)) ≈ x·ρ(20) in Dickman's convention, i.e. a vanishing proportion. Not claimed: that this heuristic is a theorem at every scale.
6. The scale at which the effect would be visible
Sensitivity is decided before any data. With N_eff(x) = (Σw)²/Σw², a relative signed bias ρ is detectable exactly when ρ·sqrt(N_eff(x)) ≳ 2, i.e. ρ_min(x) = 2/sqrt(N_eff(x)), and each block reports its own floor. For illustration only (reference case N_eff ≈ x/10, not measured here) ρ_min ≈ 6.3/√x, which is already below 1/log^K x for K ≤ 4 at x ≈ 10⁸ (K=1: ≈4·10³, K=2: ≈10⁵, K=3: ≈3·10⁶, K=4: ≈10⁸).
Rung: conjectured. N_eff is not measured here and the table depends on N_eff ≈ x/10; a
run must measure N_eff per block and report the floor it actually got. The consequence is
honest in either direction: at reachable x the sensitivity is not the binding constraint,
so a null reading from F1 is informative rather than a statement about insufficient compute
— which is exactly what kernel-sign-control.md could not say of its own regime.
7. Cost, and why this run did not execute it
The pipeline is C_{U,V}(n)·C_{Y,Z}(n−2) over n ≤ X — the correlation form already validated
in the audit's companion singleton-fiber-validation.js (per data-reuse-audit.md) —
extended by the R₁ / R_{≥2} partition and the per-fiber singleton enumeration. Cost is a
segmented μ sieve with the β weights: O(X log X) elementary operations, O(block) memory, no
CRT or DFS component. Estimated single core: X = 2³² ≲ 1 CPU-h; X = 2³⁴ ≈ 3 CPU-h.
Not executed here, and the reason is stated rather than hidden. Two hours of wall time and 4 CPU-h remain, but the partition and the admissibility gate must be built and validated against the audit's own finite checks before any S(x) is read; a partition error would produce a false null, which is a worse outcome than no reading. This return is therefore the design with its cost, as the brief permits, plus the one decisive measurement the design depends on. I did not run the statistic.
8. What remains open
- The values of S(x), ρ(x), N_eff(x) and the F2 slope — the run itself.
- Whether the singleton partition R₁ / R_{≥2} at these cutoffs is populated at reachable x; the audit validates the partition on finite intervals but does not report the singleton share at these cutoffs.
- Unchanged and untouched: the OPEN signed singleton estimate, the sufficient twin margin, and twin-prime infinitude.
9. Files, evidence and custody
new-statistic-signed-singleton.md— the full design (this report's §2–§7 in long form).new-statistic-degeneracy.js— the producer of §5; question in comments, then code.degeneracy.json— the recorded run (stdout, exit status and the enforced limit report).
The script carries its question in comments and its code; its output block is the recorded
run above. The served repo's embed tool (node research/qc/embed.js) was not available in
this working folder, so the output block was not machine-stamped by the embed: the
seconds, memory and hash figures come from the recorded run and are reproducible by the
command in the recipe. Flagged here so no reader mistakes it for an embedded tail.
10. Prior art consulted
Searched before designing. The literature convention for this object is Chowla/Elliott-style autocorrelation of μ and λ, e.g. arXiv:2206.12956 (Carella, 2026), which treats Σ_{p≤x} μ(p+a)μ(p+b) conditionally at O(x (log x)^{−c}) — prior art for the shape of the question (signed autocorrelation of μ), not for this weighted determinant-2 restriction and not for the singleton partition. No published finite range of the signed singleton statistic was located, which is consistent with the audit leaving it OPEN rather than with the question being settled elsewhere. Numerical Chowla verifications were not found at a range this design needs; the design's own sensitivity floor (§6) is what decides whether a run is worth its compute.