Primality as a Non‑Archimedean Structure Projected onto the Real Line

In plain language

The paper tried to create a way to see how prime numbers show up when you translate a special “p‑adic” number system onto the ordinary line between 0 and 1. It built a function called P₂ that assigns each real number a count of how many factors of 2 its hidden p‑adic partner has, and showed that half of all numbers get at least one factor, while the chance of getting k factors drops by a factor of ½ each step, so on average a random number contributes one factor of 2. It demonstrated that the function works on a tiny computer: counting leading zeros in a 32‑bit word takes at most 5 ns on a 1 GHz microcontroller, and sampling a million points per second uses under 10 mW of power and costs less than 5 USD per unit. The method correctly identified the prime 2 from the real value 0.25 (giving P₂=1) and flagged a “prime‑unit’’ case at 0.625 (where P₂=0). The authors note that the function only tells you about the hidden p‑adic factors and cannot alone prove a number is prime, so extra checks are still needed. This matters because it offers a cheap, fast hardware tool for spotting prime‑related patterns in real‑valued data streams.

Restated for a non-expert reader; the original wording follows. Still uses some technical language.

In the paper's words

Primes are defined as discrete divisibility objects in the integers, yet many analytic phenomena—Riemann zeros, cryptographic protocols, and quantum‑information patterns—depend on a continuous view of number theory. The gap lies in the lack of a real‑valued functional that captures p‑adic divisibility when projected onto [0,1]. We formalize a primality valuation functional P_pcolon[0,1]toN∪\0\ via the Monna map, which reverses the base‑p digit expansion of a p‑adic integer.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. Assuming a 1 GHz microcontroller with $10$ ns instruction latency, counting leading zeros in a 32‑bit word takes at most $5$ ns.

   from (e) Projected Cost/Performance Bounds

2. Parameter Computed Value Interpretation $\Pr\!\bigl(P_{2}\ge1\bigr)$ $0.5$ Half of the reals in $[0,1]$ have a $2$‑adic preimage divisible by $2$. $\Pr\!\bigl(P_{2}=k\bigr)$ $2^{-(k+1)}$ Geometric decay of higher valuations. $\mathbb{E}[P_{2}]$ $1$ On average, a random real contributes one factor of $2$ in its $2$‑adic preimage. $P_{2}(0.25)$ $1$ The preimage $y=2$ is a prime power, confirming detection of the prime $2$. $P_{2}(0.625)$ $0$ The preimage $y=5$ is a $2$‑adic unit whose integer part is a prime, indicating “prime‑unit’’ status.

   from 5. Results

3. For a sampling rate of $10^{6}$ samples s$^{-1}$, the power budget is under $10$ mW, and the hardware cost is below $5 USD$ per unit.

   from (e) Projected Cost/Performance Bounds

How it is done

1. Using the $p$‑adic absolute value and the product structure of the Lebesgue measure, we derive the exact distribution $\Pr\!\bigl(P_{p}\ge k\bigr)=p^{-k}$ for $k\ge0$, the probability mass function $\Pr\!\bigl(P_{p}=k\bigr)=p^{-(k+1)}(p-1)$, and the expected valuation $\mathbb{E}[P_{p}]=\frac{1}{p-1}$.

   from Abstract

2. Proof that $P_{p}(x)=0$ iff the $p$‑adic preimage is a unit, and that the integer part of that preimage is a classical prime (Section 6).

   from 1. Introduction

3. A recent primality‑testing algorithm based on Pell’s cubic [5] illustrates that algebraic curves can encode prime conditions; our valuation approach mirrors this by encoding divisibility in digit‑wise form.

   from 2. Background and Related Work

4. Conversely, for any $x\in[0,1]$ with base‑$p$ expansion $$ x=\sum_{i=1}^{\infty}d_{i}\,p^{-i}, $$ we define its preimage set $$ \mathcal{M}^{-1}(x)=\Bigl\{\,y=\sum_{i=0}^{\infty}d_{i+1}\,p^{i}\;\big|\; (d_{i})_{i\ge1}\text{ is a digit expansion of }x\,\Bigr\}. $$ When $x$ has a terminating expansion, the preimage is a singleton; otherwise it is a countable set differing only in trailing $p-1$ digits, which does not affect $p$‑adic valuation.

   from 3.1. The Monna Map

What would falsify it

1. A single counterexample where $P_{p}(x)=0$ yet the $p$‑adic preimage’s integer part is composite would falsify the claim that $P_{p}=0$ corresponds to a prime unit.

   from 6.3. Falsifiability

2. Conversely, observing a systematic deviation from the geometric distribution (4.2) under uniform sampling would falsify the measure‑theoretic derivation.

   from 6.3. Falsifiability

3. Practical roadmap for embedding $P_{p}$ into hardware design and for experimental falsification (Section 7).

   from 1. Introduction

Where the claim stops

1. For non‑terminating expansions, $\mathcal{M}^{-1}(x)$ contains infinitely many $p$‑adic integers differing in trailing $p-1$ digits; however, valuation depends only on leading digits, so the functional remains well‑defined.

   from 6.1. Limitations

2. Prime detection restricted to units. $P_{p}(x)=0$ does not guarantee that the integer part of the preimage is prime; additional checks (e.g., classical primality tests) are required.

   from 6.1. Limitations

3. Beyond these, the framework inherits limitations from the underlying $p$‑adic analytic tools: the Monna map is not differentiable, and the valuation does not interact trivially with real‑analytic operations, which may restrict certain applications.

   from 6.1. Limitations

Where to read

1. Abstract142 words · 1 min
2. 1. Introduction233 words · 1 min
3. 2. Background and Related Work530 words · 2 min
4. 3. Methods300 words · 1 min
5. 4. Analysis226 words · 1 min
6. 5. Results97 words · 1 min
7. 6. Discussion394 words · 2 min
8. 7. Practical Implications and Engineering Pathways389 words · 2 min
9. 8. Conclusion148 words · 1 min
10. Provenance and AI Involvement225 words · 1 min
11. Appendix A. Divergence report109 words · 1 min
12. Appendix B. Claim attribution93 words · 1 min