arXiv subjects

Tristan Freiberg

Publications and source records attributed to Tristan Freiberg.

16 recordsLinked to original sources

arXiv2025

JSTprove: Pioneering Verifiable AI for a Trustless Future

The integration of machine learning (ML) systems into critical industries such as healthcare, finance, and cybersecurity has transformed decision-making processes, but it also brings new challenges around trust, security, and accountability. As AI systems become more ubiquitous, ensuring the transparency and correctness of AI-driven decisions is crucial, especially when they have direct consequences on privacy, security, or fairness. Verifiable AI, powered by Zero-Knowledge Machine Learning (zkML), offers a robust solution to these challenges. zkML enables the verification of AI model inferences without exposing sensitive data, providing an essential layer of trust and privacy. However, traditional zkML systems typically require deep cryptographic expertise, placing them beyond the reach of most ML engineers. In this paper, we introduce JSTprove, a specialized zkML toolkit, built on Polyhedra Network's Expander backend, to enable AI developers and ML engineers to generate and verify proofs of AI inference. JSTprove provides an end-to-end verifiable AI inference pipeline that hides cryptographic complexity behind a simple command-line interface while exposing auditable artifacts for reproducibility. We present the design, innovations, and real-world use cases of JSTprove as well as our blueprints and tooling to encourage community review and extension. JSTprove therefore serves both as a usable zkML product for current engineering needs and as a reproducible foundation for future research and production deployments of verifiable AI.

cs.CR↗

arXiv2025

DSperse: A Framework for Targeted Verification in Zero-Knowledge Machine Learning

DSperse is a modular framework for distributed machine learning inference with strategic cryptographic verification. Operating within the emerging paradigm of distributed zero-knowledge machine learning, DSperse avoids the high cost and rigidity of full-model circuitization by enabling targeted verification of strategically chosen subcomputations. These verifiable segments, or "slices", may cover part or all of the inference pipeline, with global consistency enforced through audit, replication, or economic incentives. This architecture supports a pragmatic form of trust minimization, localizing zero-knowledge proofs to the components where they provide the greatest value. We evaluate DSperse using multiple proving systems and report empirical results on memory usage, runtime, and circuit behavior under sliced and unsliced configurations. By allowing proof boundaries to align flexibly with the model's logical structure, DSperse supports scalable, targeted verification strategies suited to diverse deployment needs.

cs.AI↗

arXiv2017

Sparser variance for primes in arithmetic progression

We obtain an analog of the Montgomery-Hooley asymptotic formula for the variance of the number of primes in arithmetic progressions. In the present paper the moduli are restricted to the sequences of integer parts $[F(n)]$, where $F(t) = t^c$ ($c > 1$, $c \not\in \mathbb{N}$) or $F(t) = \exp\big((\log t)^{\gamma}\big)$ ($1 < \gamma < 3/2$).

math.NT↗

arXiv2017

Poisson distribution for gaps between sums of two squares and level spacings for toral point scatterers

We investigate the level spacing distribution for the quantum spectrum of the square billiard. Extending work of Connors--Keating, and Smilansky, we formulate an analog of the Hardy--Littlewood prime $k$-tuple conjecture for sums of two squares, and show that it implies that the spectral gaps, after removing degeneracies and rescaling, are Poisson distributed. Consequently, by work of Rudnick and Uebersch\"ar, the level spacings of arithmetic toral point scatterers, in the weak coupling limit, are also Poisson distributed. We also give numerical evidence for the conjecture and its implications.

math-ph↗

arXiv2015

Short intervals with a given number of primes

A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is asymptotically equal to $\lambda^me^{-\lambda}/m!$ as $x$ tends to infinity. We show that the number of such $n$ is at least $x^{1 - o(1)}$.

math.NT↗

arXiv2015

Carmichael numbers and the sieve

Using the sieve, we show that there are infinitely many Carmichael numbers whose prime factors all have the form $p = 1 + a^2 + b^2$ with $a,b \in{\mathbb Z}$.

math.NT↗

arXiv2014

A note on square totients

A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q - 1)$ is a perfect square.

math.NT↗

arXiv2014

The average of the first invariant factor for reductions of CM elliptic curves mod $p$

Let $E/\mathbb{Q}$ be a fixed elliptic curve. For each prime $p$ of good reduction, write $E(\mathbb{F}_p) \cong \mathbb{Z}/d_p \mathbb{Z} \oplus \mathbb{Z}/e_p \mathbb{Z}$, where $d_p \mid e_p$. Kowalski proposed investigating the average value of $d_p$ as $p$ runs over the rational primes. For CM curves, he showed that $x\log\log{x}/\log{x} \ll \sum_{p \le x} d_p \ll x\sqrt{\log{x}}$. It was shown recently by Felix and Murty that in fact $\sum_{p \le x} d_p$ exceeds any constant multiple of $x\log\log{x}/\log{x}$, once $x$ is sufficiently large. In the opposite direction, Kim has shown that the expression $x\sqrt{\log{x}}$ in the upper bound can be replaced by $x\log\log{x}$. In this paper, we obtain the correct order of magnitude for the sum: $\sum_{p \le x} d_p \asymp x$ for all large $x$.

math.NT↗

arXiv2014

On limit points of the sequence of normalized prime gaps

Let $p_n$ denote the $n$th smallest prime number, and let $\boldsymbol{L}$ denote the set of limit points of the sequence $\{(p_{n+1} - p_n)/\log p_n\}_{n = 1}^{\infty}$ of normalized differences between consecutive primes. We show that for $k = 9$ and for any sequence of $k$ nonnegative real numbers $\beta_1 \le \beta_2 \le ... \le \beta_k$, at least one of the numbers $\beta_j - \beta_i$ ($1 \le i < j \le k$) belongs to $\boldsymbol{L}$. It follows at least $12.5%$ of all nonnegative real numbers belong to $\boldsymbol{L}$.

math.NT↗

arXiv2013

Consecutive primes in tuples

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in $\mathbb{Z}[x]$, the set $\mathcal{H}(n) = \{gn + h_j\}_{j=1}^k$ contains at least $m$ primes for infinitely many $n \in \mathbb{N}$. In this note, we deduce that $\mathcal{H}(n) = \{gn + h_j\}_{j=1}^k$ contains at least $m$ consecutive primes for infinitely many $n \in \mathbb{N}$. We answer an old question of Erd\H os and Tur\'an by producing strings of $m + 1$ consecutive primes whose successive gaps $\delta_1,\ldots,\delta_m$ form an increasing (resp. decreasing) sequence. We also show that such strings exist with $\delta_{j-1} \mid \delta_j$ for $2 \le j \le m$. For any coprime integers $a$ and $D$ we find arbitrarily long strings of consecutive primes with bounded gaps in the congruence class $a \bmod D$.

math.NT↗

arXiv2013

A note on the theorem of Maynard and Tao

As a corollary to the recent extraordinary theorem of Maynard and Tao, we re-prove, in a stronger form, a result of Shiu concerning "strings" of consecutive, congruent primes.

math.NT↗

arXiv2013

Mertens's theorem for splitting primes and more

Myriad articles are devoted to Mertens's theorem. In yet another, we merely wish to draw attention to a proof by Hardy, which uses a Tauberian theorem of Landau that "leads to the conclusion in a direct and elegant manner". Hardy's proof is also quite adaptable, and it is readily combined with well-known results from prime number theory. We demonstrate this by proving a version of the theorem for primes in arithmetic progressions with uniformity in the modulus, as well as a non-abelian analogue of this.

math.NT↗

arXiv2012

On the average exponent of elliptic curves modulo p

Given an elliptic curve E/Q and a prime p at which E has good reduction, let e_p be the exponent of the group E_p(F_p) of F_p-rational points on the reduction of E modulo p. Under the Generalized Riemann Hypothesis (GRH) for the Dedekind zeta functions of the division fields of E, we show that there is a certain constant c_E, depending on E and satisfying 0 < c_E < 1, such that e_p/#E_p(F_p) is equal to c_E on average. In the case where E has complex multiplication (CM) the result holds without GRH. If E is a non-CM curve we show that c_E is equal to a rational number depending on E times a universal constant c = \prod_q {1 - q^3/(q^2-1)(q^5-1)} = 0.899..., the product being over all primes q.

math.NT↗

arXiv2011

Strings of congruent primes in short intervals II

Let $p_1 = 2, p_2 = 3,...$ be the sequence of all primes. Let $ε$ be an arbitrarily small but fixed positive number, and fix a coprime pair of integers $q \ge 3$ and $a$. We will establish a lower bound for the number of primes $p_r$, up to $X$, such that both $p_{r+1} - p_{r} < ε\log p_r$ and $p_{r} \equiv p_{r+1} \equiv a \bmod q$ simultaneously hold. As a lower bound for the number of primes satisfying the latter condition, the bound we obtain improves upon a bound obtained by D. Shiu.

math.NT↗

arXiv2010

Products of shifted primes simultaneously taking perfect power values

Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are perfect $r$th powers for all $a \in A$. Also, in the cases $A = \{-1\}$ and $A = \{+1\}$, we will obtain a lower bound for the number of such $n$ with exactly $r$ distinct prime factors.

math.NT↗

arXiv2010

Strings of congruent primes in short intervals

Fix \epsilon > 0, and let p_1 = 2, p_2 = 3,... be the sequence of all primes. We prove that if (q,a) = 1 then there are infinitely many pairs p_r, p_{r+1} such that p_r \equiv p_{r+1} \equiv a \mod q and p_{r+1} - p_r < \epsilon\log p_r. The proof combines the ideas of Shiu and Goldston-Pintz-Yildirim.

math.NT↗