<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Foundational-Theory on Scaling Trust Community</title><link>https://scalingtrust.org.uk/tags/foundational-theory/</link><description>Recent content in Foundational-Theory on Scaling Trust Community</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 07 Oct 2026 00:00:00 +0100</lastBuildDate><atom:link href="https://scalingtrust.org.uk/tags/foundational-theory/index.xml" rel="self" type="application/rss+xml"/><item><title>Foundations for AI-Native Proof Systems</title><link>https://scalingtrust.org.uk/projects/ai-native-proof-systems/</link><pubDate>Wed, 07 Oct 2026 00:00:00 +0100</pubDate><guid>https://scalingtrust.org.uk/projects/ai-native-proof-systems/</guid><description>Alessandro Chiesa · EPFL</description><content:encoded><![CDATA[<p>This project will investigate whether the recurring structure of AI computations can support more efficient proofs than generic circuit-based approaches. It also explores self-proving models, and the boundary between computations that can remain black-box and those that must be decomposed for verification.</p>
<h2 id="outputs">Outputs</h2>
<p>Repositories, papers, and demos will be linked here as the work gets underway.</p>
<h2 id="background-reading">Background reading</h2>
<ul>
<li><a href="https://arxiv.org/abs/2405.15722" target="_blank" rel="noopener noreferrer">Models That Prove Their Own Correctness</a> — Noga Amit, Shafi Goldwasser, Orr Paradise, Guy N. Rothblum · NeurIPS 2025. Introduces self-proving models, which learn to produce checkable proofs alongside their answers.</li>
<li><a href="https://arxiv.org/abs/2404.16109" target="_blank" rel="noopener noreferrer">zkLLM: Zero Knowledge Proofs for Large Language Models</a> — Haochen Sun, Jason Li, Hongyang Zhang · ACM CCS 2024. Specialised proofs for attention and tensor operations: an example of exploiting the structure of AI computations instead of generic circuits.</li>
</ul>
]]></content:encoded></item><item><title>Advanced Cryptography for AI</title><link>https://scalingtrust.org.uk/projects/advanced-cryptography-for-ai/</link><pubDate>Wed, 07 Oct 2026 00:00:00 +0100</pubDate><guid>https://scalingtrust.org.uk/projects/advanced-cryptography-for-ai/</guid><description>Tom Gur · University of Cambridge</description><content:encoded><![CDATA[<p>Privacy techniques suited to AI workloads, built with cryptography: private retrieval for RAG, semantic search, secure computation, and methods for concealing queries or embeddings. The aim is to let agents use shared memory and sensitive data without exposing commercially or personally confidential information.</p>
<p><strong>Team:</strong> Nir Bitansky (NYU); Yuval Ishai (Technion); Ron Rothblum (Succinct/Technion); Sarah Meiklejohn (UCL/Google)</p>
<h2 id="outputs">Outputs</h2>
<p>Repositories, papers, and demos will be linked here as the work gets underway.</p>
<h2 id="background-reading">Background reading</h2>
<ul>
<li><a href="https://eprint.iacr.org/2022/949" target="_blank" rel="noopener noreferrer">One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval</a> — Alexandra Henzinger, Matthew M. Hong, Henry Corrigan-Gibbs, Sarah Meiklejohn, Vinod Vaikuntanathan · USENIX Security 2023. SimplePIR: practical private retrieval, a building block for private access to shared data.</li>
<li><a href="https://eprint.iacr.org/2023/1438" target="_blank" rel="noopener noreferrer">Private Web Search with Tiptoe</a> — Alexandra Henzinger, Emma Dauterman, Henry Corrigan-Gibbs, Nickolai Zeldovich · SOSP 2023. Private search over semantic embeddings: the closest existing system to concealing queries and embeddings in retrieval.</li>
</ul>
]]></content:encoded></item></channel></rss>