<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Jolt Atlas: Verifiable Inference via Lookup Arguments in Zero Knowledge · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2602.17452/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2602.17452/feed.xml" rel="self" type="application/rss+xml" /><item><title>Jolt Atlas: Verifiable Inference via Lookup Arguments in Zero Knowledge — mentioned by wyattbenno</title><link>https://news.ycombinator.com/item?id=47275031</link><guid isPermaLink="false">urn:hackerpapers:mention:2602.17452:47275031</guid><pubDate>Fri, 06 Mar 2026 14:04:03 GMT</pubDate><description>&lt;p&gt;Hi, AI Agents Can Move Money. Lobstar Wilde Proved They Can Lose It Too... So we made: (ARc + ZK) Neurosymbolic formal reasoning w/ zero knowledge proofs for cryptographically secure agentic guardrails. Our approach has two essential properties for agentic commerce: (1) succinct proofs and (2) optional privacy. The core idea is from the Automated Reasoning Checks (ARc) paper (https://arxiv.org/pdf/2511.09008) which converts natural language policies into SMT-LIB constraints and checks agent actions against an SMT solver rather than an LLM judge. The solver proofs are not succinctly verifiable…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2602.17452/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item></channel></rss>
