Pith. sign in

REVIEW 3 major objections 6 minor 8 references

Multi-scale representation of integer sets: application to prime numbers

T0 review · 3 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper proposes a multi-scale 8-bit encoding of primality and claims that, for large intervals, all pattern histograms converge to one invariant shape, with an explicit binomial estimate for every bin.

desk verdict A clean new visual encoding for primes, with a histogram estimator that only fits Hamming-weight aggregates, not the 256 bins it claims. read the letter →

arxiv 2506.03005 v2 pith:ELE7IY6D submitted 2025-06-03 math.RA

Mahmoud Melkemi This is my paper
classification math.RA MSC 11A4111N0511Y16
keywords multi-scaleanalysisprimenumbers8-bitpatternsinvarianthistogramshapebinomialmodelMersenneprimeshierarchicalencodingdensityof
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper introduces a hierarchical way to encode an integer set: at scale $k$, blocks of $8^k$ consecutive integers are compressed into an 8-bit pattern, written as a decimal between 0 and 255, that records where the property holds. Applied to primality, only 14 of the 256 possible finest patterns ever occur, and the paper proposes that for large enough intervals the histograms of these patterns at every coarser level settle into one invariant shape, characteristic of prime numbers. The paper also derives an explicit estimate for each histogram bin, a binomial-type formula with empirical correction factors built on the probability $p(m)=2\,\mathrm{li}(m)/m$ that an odd number below $m$ is prime. If the claim holds, the method gives a compact, scale-independent statistical signature of primality, and the same machinery is shown to sharply restrict the patterns of Mersenne primes.

What carries the argument

The central object is the nested sequence of 8-bit patterns $f^{(k)}(n)$, defined recursively by $f^{(1)}(n)=\sum_{j=0}^{7}\phi_0(8n+1+j)\,2^{7-j}$ and $f^{(k+1)}(n)=\sum_{j=0}^{7}\phi_k(f^{(k)}(8n+j))\,2^{7-j}$, where each $\phi_k$ flags whether a sub-block contains at least one prime. The argument rides on treating the number of ones in a $k$-pattern as a binomial count with per-trial probability $q_{k-1}(m)$ (the chance that a $(k-1)$-pattern contains a prime), together with empirical correction factors $C_j^{(k)}(m)$ that absorb the failure of independence and the approximation in $p(m)=2\,\mathrm{li}(m)/m$.

What would settle it

Compute the histograms of $f^{(2)}(n)$ and $f^{(3)}(n)$ over much larger intervals, for example up to $m=10^{11}$, and check whether the empirical ratios $\pi_m^{(k)}(j)/\big((m/8^k)\,q_{k-1}(m)^j\,(1-q_{k-1}(m))^{8-j}\big)$ stabilize inside a fixed bounded band as $m$ grows, and whether the normalized histograms keep the same outline as the one reported near $m=10^9$. If the ratios drift without bound or the outline changes, the invariant-shape conjecture and the binomial estimate are refuted.

Watch

Extended reading notes

Core claim

Stated on the paper's own terms: for primes, the multi-scale sequences $f^{(k)}(n)$ take values in $\{0,\dots,255\}$, and for a sufficiently large interval $[1,m]$ the histograms of the $k$-patterns, for every $k\ge 2$, share the same outline, a shape that remains invariant as $m$ grows and that the paper treats as a characteristic of prime numbers. The count of each histogram bin is approximated by $C_j^{(k)}(m)\,\frac{m}{8^k}\,q_{k-1}(m)^{j}\,(1-q_{k-1}(m))^{8-j}$, where $j$ is the number of ones in the pattern, $q_{k-1}(m)=1-(1-p(m))^{4\cdot 8^{k-2}}$, and $p(m)=2\,\mathrm{li}(m)/m$; the empirical factors $C_j^{(k)}(m)$ are bounded (below 2 for the tested levels, and inside $[1/2,3/2]$ for the first-level factors when $m>16{,}777{,}216$) and absorb the correlations that a strict independence model misses. At the finest scale the admissible patterns are exactly the 14 masks compatible with divisibility by 3, and for Mersenne primes the first-level patterns reduce to $\{0,2,8,10,42,128\}$, with no observed block containing more than one Mersenne prime.

Load-bearing premise

The whole histogram estimate assumes that every odd number in $[1,m]$ has the same probability $p(m)=2\,\mathrm{li}(m)/m$ of being prime and that the four odd candidates in each 8-block, and the blocks across the interval, behave like independent coin flips; real primes are correlated, so the correction factors $C_j^{(k)}(m)$ carry the entire burden of fixing that assumption numerically.

Editorial extensions

If this is right

  • The invariant histogram shape provides a scale-independent statistical signature of primality: the same outline appears at level 2, level 3, and beyond once $m$ is large enough.
  • The binomial estimate gives a way to predict how often each local prime pattern occurs without sieving the whole interval, up to the bounded correction factors.
  • The 14-pattern restriction at level 1, together with the reconstruction algorithm, allows a large interval of primes to be stored and queried through a short sequence of small integers.
  • For Mersenne primes the pattern set shrinks to $\{0,2,8,10,42,128\}$, and the observation that no block contains more than one Mersenne prime quantifies their extreme rarity over the tested range.
  • The density argument shows there is a finite scale at which every block of size $8^k$ can no longer contain a prime, with a practical bound around $m=e^{27}$ for level 3.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the invariant shape survives tests at much larger $m$, the same hierarchical encoding could be applied to other arithmetic properties by replacing $\phi_0$, with the binomial model adjusted by an appropriate per-block probability.
  • The approximate symmetries among correction factors (for instance $C_2\approx C_{128}$) suggest a reflection structure in how residues modulo 8 correlate with primality; checking whether these symmetries persist to larger scales would probe those correlations directly.
  • The method could serve as a statistical test of pseudorandomness: a set whose multi-scale histograms deviate from the prime signature would be detectably non-random in a way that ordinary density estimates would miss.
  • One testable extension is to compute the ratios $\pi_m^{(k)}(j)/\big((m/8^k)\,q_{k-1}(m)^j\,(1-q_{k-1}(m))^{8-j}\big)$ for several $k$ over disjoint million-scale windows; stability of these ratios would confirm the conjecture and produce a practical calibration of the correction factors.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper introduces a multi-scale binary encoding of integer sequences, in which blocks of 8 integers are represented by 8-bit patterns, and the construction is iterated to higher scales. The method is applied to prime numbers up to 982,451,200, producing level-1 patterns restricted to 14 values, level-2 and level-3 histograms, and a conjecture that these histograms share an invariant shape for sufficiently large intervals. The paper also gives approximate formulas for histogram bin counts using binomial probabilities multiplied by correction coefficients C_j^{(k)}(m), and applies the same encoding to Mersenne primes. The main claimed contributions are the multi-scale representation itself, the observation of an invariant histogram shape, and 'an estimation for each value in the histogram and at all scales.'

Significance. The descriptive parts of the paper are clear and easy to verify from public prime tables: Observation 1 correctly identifies the 14 admissible level-1 patterns, and Tables 1-3 report reproducible histogram data. The multi-scale encoding is a reasonable exploratory tool for visualizing prime distributions at different granularities, and the observed repetition of histogram shapes across scales is a potentially interesting phenomenological fact. However, the paper's analytic claims are not established: the correction coefficients are fitted to the same data they are supposed to predict, and the level-2 and level-3 formulas depend only on the Hamming weight of a pattern, so they cannot estimate individual histogram bins. The invariant-shape conjecture is presented as an empirical observation but is not supported by the proposed model, and no quantitative or out-of-sample evidence is supplied. The paper is honest in stating that it does not claim new results on primes, but the central 'estimation' claim is currently overstated.

major comments (3)
  1. [Section 2.3, Observation 4(2) and Table 3] The estimator in Observation 4(2), namely pi_m^(k)(n) approximately equal to C_j^(k)(m) (m/8^k) q_{k-1}(m)^j (1 - q_{k-1}(m))^{8-j} with j = np_k(n), depends on n only through the Hamming weight j. It therefore assigns the same expected count to every k-pattern with the same number of ones, so it cannot provide 'an estimation for each value in the histogram' as claimed in the abstract. Table 3 shows the degeneracy is empirically false at level 3: among j=6 patterns, counts range from 649 (pattern 63) to 868 (pattern 126), a spread of 219 against a Poisson standard deviation of about 28 for counts near 800; among j=7 patterns, counts range from 35,878 (pattern 127) to 36,182 (pattern 253). The formula at best describes a 9-bin Hamming-weight aggregate, not the 256-bin histogram whose irregular shape is the paper's central observation. The invariant-shape conjecture in Section 2.2 is therefore not derivable from, and is not even compatible with, the stated estimator.
  2. [Section 2.1, Equation (8), and Section 2.2, Observation 3] Equations (8) and Observation 3(2) are not independent predictions. The correction coefficients C_j^(1)(m) and C_j^(2)(m) are introduced after the empirical histograms are displayed, and the text states that they were introduced 'to correct the approximations and the independence assumption'; no closed-form expression, out-of-sample validation, or error analysis is provided. Once the fitted C_j are inserted, the level-1 formula for a specific pattern is essentially a restatement of the measured count, and the level-2 formula fits only Hamming-weight totals. The binomial factors also rest on the independence of the four odd numbers in a block and of adjacent blocks, which is known to fail for primes; twin and k-tuple correlations are absorbed into the fitted C_j without a model. Consequently, the claim that the paper proposes a mathematical estimation of each histogram bin is not supported.
  3. [Section 2.2, The Invariance Shape of the k-Patterns Histogram] The conjecture that all histograms of f^(k)(n) for k >= 2 share the same invariant shape is supported only by visual inspection of histograms computed on the single interval [1, Nmax] and by Observation 4, which, as noted above, depends only on Hamming weight. No evidence is given that the shape is independent of the upper limit m beyond Nmax, no quantitative measure of shape invariance (for example, a normalized distance between histograms at different m) is provided, and the irregular within-weight structure visible in Figure 8a and Table 3 is not explained by the proposed formula. The invariant-shape claim is therefore an unexplained empirical regularity rather than a consequence of the model.
minor comments (6)
  1. [Section 3, Reconstruction Algorithm] In the paragraph preceding Algorithm 1, the text says 'it determines L1 = D2B(f^(2)(8(8n + j) + i))', but this should refer to f^(1), since L1 is a level-1 pattern; the algorithm itself correctly uses pattern1[k].
  2. [Section 2.1, Equation (5)] Observation 1 states that f^(1)(n) takes only the 14 values in P1, but the value 106 occurs only for n = 0; for n >= 1 it is impossible. The statement should specify the domain n = 0 separately to avoid ambiguity.
  3. [Section 2.2, Observation 5 and Definition 2] Definition 2 says the primes are dense 'if for all n' the intersection is non-empty, but for n such that P^(k)(n) lies entirely beyond m the intersection is empty by construction; the definition should restrict n to blocks intersecting [1, m].
  4. [Section 4, Observations 6 and 7] Observations 6 and 7 are based on finite computations (1 < m <= M with M = 1000, and 0 <= m <= 500) but are phrased as general statements; the finite scope should be stated explicitly in each observation.
  5. [Figure 7] The column header 'n' in the tables of Figure 7 denotes the pattern value, not the index n used elsewhere in the paper; renaming this column would prevent confusion.
  6. [References] Reference [2] contains a typo ('Elsvier' for 'Elsevier'), and the data source in reference [6] cites a Wikipedia page; a direct citation to the PrimePages data files would be more appropriate.

Circularity Check

3 steps flagged · score 6.0 of 10

Histogram 'estimates' reduce by construction to empirically introduced correction factors C_j; Observation 4 depends only on Hamming weight, so the claimed per-bin invariant shape is not derived from the stated model.

  1. fitted input called prediction [Section 2.1, Justifications following Observation 2 (Equation (8))]
    "To correct the approximations and the independence assumption, we introduce a correction function C^{(1)}_j (m): π^{(1)}_m (j) ≈ C^{(1)}_j (m) m/8 p(m)(1 − p(m))^3. The other formulas in Equation (8) are obtained through analogous reasoning. The formal determination of the coefficients C^{(1)}_2 (m) may be the subject of future work."

    The correction function C_j is introduced after the histogram counts are already known and is left undetermined. Solving the displayed equation for C_j makes the 'estimate' identically equal to the observed histogram, so Equation (8) is a definition of C_j rather than a prediction of π_m^{(1)}(j). The paper explicitly defers the formal determination of C_j to future work, confirming that the claimed estimation has no independent content beyond the fitted input.

  2. self definitional [Sections 2.2–2.3, Observations 3(2) and 4(2)]
    "The histogram π^{(2)}_m (n) is approximately given by: π^{(2)}_m (n) ≈ C^{(2)}_j (m) m/64 q_1(m)^j (1 − q_1(m))^{8−j} where np_2(n)=j. ... π^{(k)}_m (n) ≈ C^{(k)}_j (m) m/8^k q_{k−1}(m)^j (1 − q_{k−1}(m))^{8−j} where np_k(n)=j."

    The right-hand side depends on n only through the Hamming weight j = np_k(n), and C_j is indexed only by j. Thus every histogram bin whose pattern has the same number of 1-bits is assigned the same expected count, so the formula describes, at best, a 9-bin weight aggregate rather than 'an estimation for each value in the histogram.' The empirical bins within a weight class differ substantially (for example, Table 3 gives 649 for pattern 63 and 868 for pattern 126, both with j=6), so the individual-bin estimates are not consequences of the model; they are the observed counts collapsed by weight.

1 more flagged steps
  1. other [Section 2.2, 'The Invariance Shape of the k-Patterns Histogram']
    "We conjecture that for a sufficiently large interval, the shape illustrated by Figure 8 holds for every histogram of the sequence f^{(k)}(n) with k ≥ 2, and remains invariant as the interval size increases. This assertion is based on the study of the histogram estimation of f^{(k)}(n) described in Observation 4."

    The invariant-shape conjecture is explicitly justified by Observation 4, but Observation 4 depends on the empirically introduced correction factors C_j and, through those factors, on the very histograms whose shape is being explained. Because the estimator reduces to a fitted, Hamming-weight-only aggregate, citing it as the basis for a per-bin invariant shape makes the support for the conjecture the same fitted data it is supposed to characterize. The empirical regularity may be real, but the stated derivation does not provide independent evidence for it.

full rationale

The paper contains no load-bearing self-citations; the cited literature is external and the construction is self-contained. The central circularity is internal: C_j is introduced after the data to absorb approximation and independence errors, and is then used in formulas presented as 'estimations.' Since C_j is undetermined and can be chosen to match any observed histogram, Equation (8) is a tautological curve fit rather than a prediction. Observation 4 inherits this fitted character and, moreover, depends only on the Hamming weight j, so it collapses the 256 histogram bins into nine weight classes and cannot estimate individual bin values; Table 3 documents large within-class variation that the formula does not model. The invariant-shape conjecture then cites Observation 4 as its basis, so its stated support reduces to the same empirical histograms it describes. Some independent content remains in the input p(m)=2 li(m)/m and in the recursive q_k construction, but these determine only a coarse weight-level trend and do not yield the per-bin irregular shape that is the paper's central observation. The score reflects that the central claim is partially circular through the fitted correction factors and the unsupported per-bin inference, while the raw empirical observations and the coarse binomial trend retain independent value.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

The model's counts are driven by one fitted function per level, C^(k)_j(m), and by the heuristic that each odd number is an independent Bernoulli trial with probability 2 li(m)/m. The prime number theorem supplies the baseline probability and is standard. No new physical or mathematical entities are invented: f^(k) and phi_k are defined functions, not postulates.

free parameters (3)
  • C^(1)_j(m), correction coefficients for 1-pattern histogram counts = Not given; empirically 1/2 < C_j < 3/2 for m > 16,777,216, and C_j < 2
    Introduced in Equation (8) to absorb the error of the independence and constant-probability assumptions. Their values are matched to the observed histogram, not derived. The paper says formal determination is future work.
  • C^(2)_j(m), correction coefficients for 2-pattern histogram counts = Not given; observed < 2 for m in [4,096,000, Nmax]
    Introduced in Observation 3 to force the binomial model onto the empirical 2-pattern histogram.
  • C^(k)_j(m), correction coefficients for general k-pattern counts = Not given
    Generalization in Observation 4; depends on scale k and pattern j, and is left empirical.
assumptions (4)
  • domain assumption Primality of numbers 8n+1, 8n+3, 8n+5, 8n+7 within a block is independent, and blocks are independent.
    Used to write the binomial products in Equation (8) and Observations 3-4. Prime correlations, such as twin primes, mean this is only a heuristic.
  • domain assumption Each odd number in [1,m] has the same probability p(m)=2 li(m)/m of being prime, independent of its actual size.
    Used throughout Section 2.1 to replace position-dependent probabilities with a constant; empirically tested but not a proven asymptotic statement for every residue class.
  • domain assumption The online list of the first 50 million primes is complete and error-free up to 982,451,653.
    All histograms are computed against this external dataset; no independent verification or checksum is provided.
  • standard math The prime number theorem, pi(m) ~ li(m), is used to set p(m)=2 li(m)/m.
    Standard background, not proved in the paper; unproblematic but an input to the model.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Multi-scale representation of integer sets: application to prime numbers." pith.science (2026). https://pith.science/paper/ELE7IY6D

@misc{pith2026250603005,
  author       = {Pith},
  title        = {Pith review of: Multi-scale representation of integer sets: application to prime numbers},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ELE7IY6D}},
  note         = {Machine review of arXiv:2506.03005}
}
read the original abstract

We propose a multi-scale analysis method for studying arithmetic properties of integer sets, such as primality. Our approach organizes information through a hierarchy of nested sequences, where each level enables a hierarchical expression of the studied property by examining patterns at varying levels of granularity. To illustrate the method, we apply it to prime numbers. While this does not claim any new breakthroughs on this classical problem, the approach allows for analysis of the studied property across large integer sequences and reveals characteristics observable at different scales. By limiting ourselves to the case of prime numbers, we build sequences with values in {0, ..., 255}, which have the advantage of simplifying the reading, at different scales, of the encoded property. We free ourselves from the numerous digits of large integers by replacing them with small integers between 0 and 255. We have also highlighted, at different scales, histograms composed of at most 256 values. We have observed that for a sufficiently large interval, they all share a same invariant shape, which can be viewed as a characteristic of prime numbers. Each value in the histogram represents the count of a subset of prime numbers. We have proposed an estimation for each value in the histogram and at all scales. We hope that the proposed framework will be useful for investigating arithmetic properties.

Figures

Figures reproduced from arXiv: 2506.03005 by the authors.

Figure 1
Figure 1. Multi-scale tree illustrating three resolution levels. Each node encodes the presence of prime numbers in a [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 3
Figure 3. First 49 elements of the sequence f (1)(n) arranged in a spiral. 158 223 157 182 239 254 83 246 221 251 111 182 183 239 220 253 251 191 255 255 122 159 255 127 255 255 239 243 59 237 255 255 95 254 157 111 252 58 255 123 253 249 247 222 189 189 115 223 238 [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 5
Figure 5. f (3)(n) defined in Example 1 is constant up to n = 366 n π (1) Nmax (n) n π (1) Nmax (n) 0 78 517 574 106 1 2 9 316 943 128 9 314 958 8 10 066 986 130 1 497 811 10 748 618 136 749 060 32 10 065 624 138 93 887 34 749 468 160 750 314 40 842 208 162 92 948 [PITH_FULL_IMAGE:figures/full_fig_p005_5.png] view at source ↗
Figures from the paper (3 more)
Figure 6
Figure 6. Figure 6: Over the interval [1, Nmax], the probabilities p (k) i of observing a ’1’ at digit position bi in the binary representation of k-patterns (k = 1, 2, 3). The differences between empirical and theoretical probabilities are also shown. Distance between two identical 1-pat…
Figure 7
Figure 7. Figure 7: Statistical summary of the sequences (e (j) ), j ∈ P1 2.2 Second Level To define the second level, we introduce the function ϕ1. In this example, ϕ1 is the indicator function of the presence of at least one prime number in a 1-pattern: ϕ1(n) =  1 if n ∈ P1 − {0} 0 n =…
Figure 8
Figure 8. Figure 8: Shapes of empirical and theoretical histograms for [PITH_FULL_IMAGE:figures/full_fig_p008_8.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

8 extracted references · 8 canonical work pages

  1. [1]

    Mallat, A theory for multiresolution signal decomposition: the wavelet representation, IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(7)(1989), 674-693

    S.G. Mallat, A theory for multiresolution signal decomposition: the wavelet representation, IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(7)(1989), 674-693

    work page 1989

  2. [2]

    Gerardo Iovane, The set of prime numbers: Multiscale analysis and numeric accelerators, Journal Chaos, Solitons & Fractals, Elsvier, 41(4) (2009), 1953-1965,

    work page 2009

  3. [3]

    Dusart, Explicit estimates of some functions over primes, The Ramanujan Journal,45(1) (2018), 227-251

    P. Dusart, Explicit estimates of some functions over primes, The Ramanujan Journal,45(1) (2018), 227-251

    work page 2018

  4. [4]

    D. A. Goldston, J. Pintz, and C. Y . Yıldırım, Primes in Tuples I, Annals of Mathematics, 170(2) (2009), 819-862

    work page 2009

  5. [5]

    Maynard, Small gaps between primes, Annals of Mathematics, 181(1) (2015), 383-413

    J. Maynard, Small gaps between primes, Annals of Mathematics, 181(1) (2015), 383-413

    work page 2015

  6. [6]

    https://en.wikipedia.org/wiki/PrimePages

    work page

  7. [7]

    Caldwell and Jr., G

    Chris K. Caldwell and Jr., G. L. Honaker, Prime Curios!: The Dictionary of Prime Number Trivia,CreateSpace Independent Publishing Platform, 2009

    work page 2009

  8. [8]

    Tenenbaum, Introduction to Analytic and Probabilistic Number Theory, Cambridge Studies in Advanced Mathematics, 1995

    G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory, Cambridge Studies in Advanced Mathematics, 1995. 13

    work page 1995

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.