Tootfinder

Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability
Zan-Kai Chong, Hiroyuki Ohsaki, Bryan Ng
https://arxiv.org/abs/2509.11068 https://

Tractable Asymmetric Verification for Large Language Models via Deterministic Replicability
The landscape of Large Language Models (LLMs) shifts rapidly towards dynamic, multi-agent systems. This introduces a fundamental challenge in establishing computational trust, specifically how one agent can verify that another's output was genuinely produced by a claimed LLM, and not falsified or generated by a cheaper or inferior model. To address this challenge, this paper proposes a verification framework that achieves tractable asymmetric effort, where the cost to verify a computation is su…

A Denotational Product Construction for Temporal Verification of Effectful Higher-Order Programs
Kazuki Watanabe, Mayuko Kori, Taro Sekiyama, Satoshi Kura, Hiroshi Unno
https://arxiv.org/abs/2510.11320

A Denotational Product Construction for Temporal Verification of Effectful Higher-Order Programs
We propose a categorical framework for linear-time temporal verification of effectful higher-order programs, including probabilistic higher-order programs. Our framework provides a generic denotational reduction -- namely, a denotational product construction -- from linear-time safety verification of effectful higher-order programs to computation of weakest pre-conditions of product programs. This reduction enables us to apply existing algorithms for such well-studied computations of weakest pr…

Contraction and entropy production in continuous-time Sinkhorn dynamics
Anand Srinivasan, Jean-Jacques Slotine
https://arxiv.org/abs/2510.12639 https://arx…

Contraction and entropy production in continuous-time Sinkhorn dynamics
Recently, the vanishing-step-size limit of the Sinkhorn algorithm at finite regularization parameter $\varepsilon$ was shown to be a mirror descent in the space of probability measures. We give $L^2$ contraction criteria in two time-dependent metrics induced by the mirror Hessian, which reduce to the coercivity of certain conditional expectation operators. We then give an exact identity for the entropy production rate of the Sinkhorn flow, which was previously known only to be nonpositive. Exam…

Politicians have now discovered that people are using Virtual Private Networks (VPNs) to protect their privacy and bypass invasive laws.
Their solution?
Entirely ban the use of VPNs. 
Yes, really.
As of this writing, Wisconsin lawmakers are escalating their war on privacy
by targeting VPNs in the name of “protecting children”
in A.B. 105/S.B. 130.
It’s an age verification bill
that requires all websites distributing material that could conceivabl…

Lawmakers Want to Ban VPNs—And They Have No Idea What They're Doing
Remember when you thought age verification laws couldn't get any worse? Well, lawmakers in Wisconsin, Michigan, and beyond are about to blow you away.It's unfortunately no longer enough to force websites to check your government-issued ID before you can access certain content, because politicians...

Tight complexity bounds for diagram commutativity verification
Artem Malko, Igor Spiridonov
https://arxiv.org/abs/2509.11331 https://arxiv.org/pdf/2509.113…

Tight complexity bounds for diagram commutativity verification
A diagram $\mathcal{D} = (G, l)$ over a monoid $M$ is an oriented graph $G = (V, E)$ endowed with a labeling $l\colon E \to M$. A diagram is commutative if and only if for any two oriented paths with the same endpoints, the products in $M$ of their edge labels coincide. We propose the first asymptotically optimal algorithm for diagram commutativity verification applicable to all graph families. For graphs with $\lvert V\rvert \preceq \lvert E\rvert \preceq \lvert V\rvert^2$, which covers most p…

Lustig:
Das #Umweltministerium Baden-Württemberg haut aufn Sonntag eine Erkenntnis von vor einem Jahr raus und gibt allen ernstes die *PIEP*-Zeitung als Referenz an.
Hier das Original von #proveg:

Towards Engineering Multi-Agent LLMs: A Protocol-Driven Approach
Zhenyu Mao, Jacky Keung, Fengji Zhang, Shuo Liu, Yifei Wang, Jialong Li
https://arxiv.org/abs/2510.12120 https:/…

Towards Engineering Multi-Agent LLMs: A Protocol-Driven Approach
The increasing demand for software development has driven interest in automating software engineering (SE) tasks using Large Language Models (LLMs). Recent efforts extend LLMs into multi-agent systems (MAS) that emulate collaborative development workflows, but these systems often fail due to three core deficiencies: under-specification, coordination misalignment, and inappropriate verification, arising from the absence of foundational SE structuring principles. This paper introduces Software En…

A Dichotomy Theorem for Multi-Pass Streaming CSPs
Yumou Fei, Dor Minzer, Shuo Wang
https://arxiv.org/abs/2509.11399 https://arxiv.org/pdf/2509.11399…

A Dichotomy Theorem for Multi-Pass Streaming CSPs
We show a dichotomy result for $p$-pass streaming algorithms for all CSPs and for up to polynomially many passes. More precisely, we prove that for any arity parameter $k$, finite alphabet $Σ$, collection $\mathcal{F}$ of $k$-ary predicates over $Σ$ and any $c\in (0,1)$, there exists $00$ there is a constant pass, $O_{\varepsilon}(\log n)$-space randomized streaming algorithm solving the promise problem $\text{MaxCSP}(\mathcal{F})[c,s-\varepsilon…

On the verification of a Nicolas inequality
Orlando Galdames-Bravo
https://arxiv.org/abs/2509.11182 https://arxiv.org/pdf/2509.11182

On the verification of a Nicolas inequality
Nicolas inequality we deal can be written as \begin{equation}\label{Nicineq} e^γ\log\log N_x < \dfrac{N_x}{φ(N_x)}\,, \end{equation} where $x\ge 2$, $N_x$ denotes the product of the primes less or equal than $x$, $γ$ is the Euler constant and $φ$ is the Euler totient function. We show that there is a large $x_0>0$ such that this inequality fails infinitely often for integers $x\ge x_0$. To this aim we analyze the sign of the Big-o function in the Mertens estimate for the sum of reciprocals …

Expansion of trivariate polynomials using proximity
Orit E. Raz
https://arxiv.org/abs/2510.12191 https://arxiv.org/pdf/2510.12191

Expansion of trivariate polynomials using proximity
We extend the proximity technique of Solymosi and Zahl [J. Combin. Theory, Ser. A (2024)] to the setting of trivariate polynomials. In particular, we prove the following result: Let $f(x,y,z)=(x-y)^2+(φ(x)-z)^2$, where $φ(x)\in \mathbb{R}[x]$ has degree at least 3. Then, for every finite $A,B,C\subset \mathbb{R}$ each of size $n$, one has $|f(A,B,C)|=Ω(n^{5/3-\varepsilon})$, for every $\varepsilon>0$, where the constant of proportionality depends on $\varepsilon$ and on ${\rm deg}(…