Tootfinder

I can foresee website hosting plans being split into "browser only" (requiring proof-of-work/proof-of-cognition cookies) and "open" (to bots, including archives and search engine indexers).
The AI scrapers (and, to some extent, many more unauthorised pen-testers) have made dynamic websites far more expensive to run over the last year or two.

On the quadratic complexity of subsets of $\mathbb{F}_p^n$ of bounded $\mathrm{VC_{2}}$-dimension
C. Terry, J. Wolf
https://arxiv.org/abs/2510.12767 https://

On the quadratic complexity of subsets of $\mathbb{F}_p^n$ of bounded $\mathrm{VC_{2}}$-dimension
In prior work, we showed that subsets of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ are well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$, where the complexity $\ell$ of the linear part and the complexity $q$ of the quadratic part are both bounded in terms of $k$, $p$, and the desired level of approximation $μ$. A key tool in the proof of this result was an arithmetic regularity lemma for the Gowers $U^3$-norm by Green and Tao, which resu…

Zk-SNARK Marketplace with Proof of Useful Work
Samuel Oleksak, Richard Gazdik, Martin Peresini, Ivan Homoliak
https://arxiv.org/abs/2510.09729 https://arxi…

Zk-SNARK Marketplace with Proof of Useful Work
Proof of Work (PoW) is widely regarded as the most secure permissionless blockchain consensus protocol. However, its reliance on computationally intensive yet externally useless puzzles results in excessive electric energy wasting. To alleviate this, Proof of Useful Work (PoUW) has been explored as an alternative to secure blockchain platforms while also producing real-world value. Despite this promise, existing PoUW proposals often fail to embed the integrity of the chain and identity of the m…

"However, international justice can seem like a faith-based community. We believe in it, but proof of its existence is rare, and almost miraculous when it happens" -- @…
Let's all pray for a miracle, then.

Justice vs Peace
As the world watches the shaky ceasefire in Gaza, the issues of peace and justice intermingle, strain, and collide. For those who work on conflicts, these are familiar tensions, but the underlying debates rarely get wider attention. The basic issue is this: to get any kind of peace deal in

Cette tristesse : une orga Š but non-lucratif qui aide des projets open-source, qui s'excuse pour des problèmes entièrement créés par des boîtes extérieures sans foi ni loi.
https://social.anoxinon.de/@Codeberg/115435661014427222

Google launches Antigravity, an "agent-first" coding tool that leverages Gemini 3 Pro and third-party models, available in free public preview (Dominic Preston/The Verge)
https://www.theverge.com/news/822833/google-antigravity-ide-coding-agent-…

Google Antigravity is an ‘agent-first’ coding tool built for Gemini 3
Available in free preview now with Gemini 3 Pro, Google Antigravity supports browser control and provides proof of its work.

Like today’s ICE,
Depression-era INS agents indiscriminately rounded up Mexicans,
presuming they were here illegally.
In Los Angeles, they targeted parks, hospitals, and work sites in Mexican communities,
demanding proof of citizenship.
High-profile raids and media campaigns announcing impending roundups served as tools of intimidation,
creating widespread fear that led to “voluntary” deportation via free one-way train tickets to Mexico.
Entire famil…

Opinion | When deportation was called repatriation: The US once expelled 1.8 million people to Mexico
Like today, Americans in the 1930s were reeling from economic hard times. Leaders made Latinos scapegoats and deported immigrants and some US citizens.

Mass-Centered GCM Framework in Perturbations of Kerr(-Newman)
Allen Juntao Fang, Elena Giorgi, Jingbo Wan
https://arxiv.org/abs/2510.10811 https://arxiv.or…

Mass-Centered GCM Framework in Perturbations of Kerr(-Newman)
The nonlinear stability problem for black hole solutions of the Einstein equations critically depends on choosing an appropriate geometric gauge. In the vacuum setting, the use of Generally Covariant Modulated (GCM) spheres and hypersurfaces has played a central role in the proof of stability for slowly rotating Kerr spacetime. In this work, we develop an alternative GCM framework, that we call mass-centered, designed to overcome the breakdown of the standard GCM construction in the charged cas…

"McTT: A Verified Kernel for a Proof Assistant"
Presentation by Junyoung Jang, joint work with Antoine Gaulin, Jason Z. S. Hu, Brigitte Pientka.
Repo: https://github.com/Beluga-lang/McTT/tree/icfp25

Proof of the $p$-adic Kazhdan-Lusztig hypothesis for $\mathrm{GL}(n)$
Kristaps John Balodis
https://arxiv.org/abs/2510.09788 https://arxiv.org/pdf/2510.097…

Proof of the $p$-adic Kazhdan-Lusztig hypothesis for $\mathrm{GL}(n)$
In this article, we prove the $p$-adic Kazhdan-Lusztig hypothesis for $\mathrm{GL}_n(F)$. While the approach via graded affine Hecke algebras due to recent work of Solleveld leads to more general results, this article serves to completes and clarifies the approach via affine Hecke algebras of Chriss and Ginzburg. In particular, this article serves as an opportunity to articulate several results which are undoubtedly known to experts, but have not been formally recorded in the literature.

Man-in-the-Middle Proof-of-Concept via Krontiris' Ephemeral Diffie-Hellman Over COSE (EDHOC) in C
Daniel Hennig, Joaquin Garcia-Alfaro
https://arxiv.org/abs/2510.10574 https…

Man-in-the-Middle Proof-of-Concept via Krontiris' Ephemeral Diffie-Hellman Over COSE (EDHOC) in C
This report presents some technical details on the authentication process of a lightweight key exchange protocol, paying attention on how Man-in-the-Middle (MitM) attacks could undermine its security, e.g., under the scope of lawful interception and its risk to facilitate mass surveillance. We focus only on some technical aspects associated to the attack scenario. Perspectives for future work are also discussed. Other specific aspects of the work, mainly focusing on the security implications of…

$\mathsf{P} \neq \mathsf{NP}$: A Non-Relativizing Proof via Quantale Weakness and Geometric Complexity
Ben Goertzel
https://arxiv.org/abs/2510.08814 https://

$\mathsf{P} \neq \mathsf{NP}$: A Non-Relativizing Proof via Quantale Weakness and Geometric Complexity
We give a compositional, information-theoretic framework that turns short programs into locality on many independent blocks, and combine it with symmetry and sparsity of masked random Unique-SAT to obtain distributional lower bounds that contradict the self-reduction upper bound under $\mathsf{P}=\mathsf{NP}$. We work in the weakness quantale $w_Q=K_{\mathrm{poly}}(\cdot\mid\cdot)$. For an efficiently samplable ensemble $D_m$ made by masking random $3$-CNFs with fresh $S_m\ltimes(\mathbb{Z}_2)^…

An efficient iteration method to reconstruct the drift term from the final measurement
Dakang Cen, Wenlong Zhang, Zhidong Zhang
https://arxiv.org/abs/2510.10940 https://

An efficient iteration method to reconstruct the drift term from the final measurement
This work investigates the inverse drift problem in the one-dimensional parabolic equation with the final time data. The authors construct an operator first, whose fixed points are the unknown drift, and then apply it to prove the uniqueness. The proof of uniqueness contains an iteration converging to the drift, which inspires the numerical algorithm. To handle the ill-posedness of the inverse problem, the authors add the mollification on the data first in the iterative algorithm, and then prov…

A Continuum Beck-type Theorem for Hyperplanes
Paige Bright, Alexander Ortiz, Dmitrii Zakharov
https://arxiv.org/abs/2510.10907 https://arxiv.org/pdf/2510.1…

A Continuum Beck-type Theorem for Hyperplanes
We prove a sharp continuum Beck-type theorem for hyperplanes. Our work is inspired by foundational work of Beck on the discrete problem, as well as refinements due to Do and Lund. The inductive proof uses recent breakthrough results in projection theory by Orponen--Shmerkin--Wang and Ren, who proved continuum Beck-type theorems for lines in $\mathbb{R}^2$ and $\mathbb{R}^n$.