PrimeMind · Wavefield experiment · Research exports v2

Prime Composite Wavefield

Integers are time. Prime clocks create periodic strike fields. Factor skeletons form the composite support between prime holes.

Pₛ 61,729 · H 500
Reuse an exported frontier CSV
Ready with the uploaded Pₛ=61,729, H=500 run.
Complete prime gaps
—
—
Selected clump
—
—
Exact prime-hole rule
H(n) = 0
—
Raw middle test
—
—

Composite support wave

The central LPF is held apart. Every remaining prime-factor occurrence contributes to the visible support, so prime positions fall exactly to zero. The distinct-branch metric ω−1 also reaches zero at composite prime powers and should not be used as a prime-hole test.

—
composite support prime hole Stack colors = individual non-LPF factor occurrences
Move across the field or click an integer to inspect its skeleton.

Prime-clock lanes

Each row is a periodic divisor clock. A vertical stack of strikes forms a composite; a prime hole has no strike from any required clock.

What the app is measuring

1 · Factor picture

n = p₁p₂⋯pΩ,   pΩ = LPF(n)

The largest prime factor is the center ridge. Every other prime-factor occurrence is a side layer. Repeated factors remain repeated.

layout constructed

2 · Composite amplitude

Alog(n) = log(n / LPF(n))
AΩ(n) = Ω(n) − 1

Both amplitudes remove exactly one central LPF. They are greater than zero for every composite and exactly zero for every prime n>1.

exact identity

3 · Clock wavefield

Cq(n) = 1 when q divides n; otherwise 0
H(n) = Σq Cq(n)

Each earlier prime q creates a periodic strike train of period q. With every required q ≤ √N included, H(n)=0 exactly at the prime holes.

exact sieve field

Why the LPF stays separate

Σ all log factors = log n

Stacking every log-factor contribution, including the LPF, forces the total to equal log n. That rising ramp is an identity and suppresses the prime-hole structure.

construction warning

Multiplicity layers

vq(n) = Σa≥1 1[qᵃ divides n]
Ω(n) = Σq vq(n)
Ω(qᵃm) = a + Ω(m),   fq,a = 1/qᵃ

Powers such as 2², 2³, and 3² create nested periodic layers with periods 4, 8, and 9. This is why they appear in the spectrum.

exact decomposition

Control test

xgap = (n − Pₛ) / (P − Pₛ)

The aligned plot compares the real factor heights with values shuffled only among positions of the same parity inside each gap. Both retain prime endpoints at zero.

artifact control

Stacked 3D → 2D side projection

xside(j) = 0, +1, −1, +2, −2, …
yside(pj) = log(pj) / log(Pmax)

Dropping integer time stacks every complete skeleton onto one plane. The alternating side slot is the same constructed layout used by the 3D view; prime-factor height remains exact. Rings report multiplicity whenever several integers project to one coordinate.

projection constructed

Exact strikes inside one gap

Bq,a(Pₛ,P) = floor((P−1)/qᵃ) − floor(Pₛ/qᵃ)

Bq,a is the exact number of multiples of qᵃ strictly between consecutive primes Pₛ and P. The frequency estimate (g−1)/qᵃ is the phase-average for the interior integer slots; the floor difference is the exact count.

exact count

Prediction boundary

P = min{n > Pₛ : H(n) = 0}

The next prime is the first future integer missed by every required frozen clock. This is exact but is still a sieve; the later prediction lab must test whether a smaller state predicts that zero.

future experiment

All-clock power height

VQ(n) = Σq∈Q, q<n vq(n)
vq(n) = Σa≥1 1[qᵃ divides n]

Each visible dot is one exact qᵃ divisibility contribution. Adding every frozen clock column preserves the inside of the composite rather than reducing it to a single height.

exact frozen field

Prime powers in ψ

Λ(n) = log p when n=pᵃ; otherwise 0
ψ(x) = Σn≤x Λ(n)

Prime powers—not arbitrary composites—are the weighted impulses in Chebyshev’s ψ function. This is the exact arithmetic object connected to zeta zeros.

classical identity

Zeta comparison boundary

ρk = ½ + iγk
Eψ(x) ≈ −Σ|γk|≤Γ xρk/ρk + corrections

The critical-line coordinate ½ controls the x½ amplitude of each retained oscillatory term. A finite reconstruction describes a band-limited fluctuation; it does not prove the Riemann hypothesis or independently predict the next prime.

rigorous diagnostic

Global layer-growth envelope

LΩ(N) = max2≤n≤N Ω(n) = ⌊log₂N⌋

The smallest integer with k factor occurrences is 2ᵏ. Thus the deepest possible layer grows by one exactly at powers of two; yellow record rings are the observed run-relative version of this envelope.

exact growth law

One clock’s layer growth

Aq(N) = #{a≥1 : qᵃ≤N} = ⌊logqN⌋

Every time N crosses qᵃ, the q-clock gains one available valuation layer. This is distinct from the number of qᵃ strikes inside any selected prime gap.

exact threshold law

Large-range sampling boundary

nj = start + jS + rotating offset

Each retained nj is factored exactly, but no statement about an omitted integer is inferred. Rotating offsets prevent a fixed stride from locking the overview to only a few residue classes.

sampled, not continuous
SymbolPlain meaningPosition in the visual
nThe integer currently being examined.Horizontal integer-time coordinate.
qAn earlier known prime acting as a periodic divisor clock.One row in the clock-lane plot.
aThe exponent in a selected prime power qᵃ.Its nested power-lane number and vertical lift.
qᵃA prime-power period; its strikes are the multiples of qᵃ.One nested pulse train with frequency 1/qᵃ.
vq(n)How many occurrences of q divide n, counting repeated powers.The summed height of q’s nested power lanes.
VQ(n)The sum of q-adic valuations for q in the frozen bank Q with q<n.The height and number of dots in an all-clock power column.
Λ(n)log p when n is exactly a prime power pᵃ; zero otherwise.A weighted event marker in the zeta comparison.
γkThe imaginary ordinate of a nontrivial zeta zero ½+iγk.One frequency in the amber reconstruction.
LPF(n)The largest prime factor of n; for a prime n, it is n itself.Center point of each 3D skeleton.
jThe occurrence rank after n's prime factors are sorted from largest to smallest. The LPF is j=0; the remaining repeated factors are j=1,2,3,….The colored lateral section in both the 3D skeleton and stacked side projection.
Ω(n)The number of prime-factor occurrences, counting repetition.Total factor-point count for n.
LΩ(N)The greatest factor depth possible through N: ⌊log₂N⌋.The amber staircase ceiling in the large-range Ω view.
Aq(N)The number of available q-power layers through N: ⌊logqN⌋.The selected clock’s layer-growth equation in the trend view.
ω(n)The number of distinct prime factors.Number of different prime branch values in the skeleton.
H(n)The number of frozen prime clocks striking n.Stacked clock-wave height; zero marks a hole.
Pₛ, PThe prime at the start and end of a completed gap.Red zero-height boundary markers.