<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>TOPLOC: A Locality Sensitive Hashing Scheme for Trustless Verifiable Inference · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2501.16007/</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/2501.16007/feed.xml" rel="self" type="application/rss+xml" /><item><title>TOPLOC: A Locality Sensitive Hashing Scheme for Trustless Verifiable Inference — mentioned by yorwba</title><link>https://news.ycombinator.com/item?id=43960802</link><guid isPermaLink="false">urn:hackerpapers:mention:2501.16007:43960802</guid><pubDate>Mon, 12 May 2025 08:31:27 GMT</pubDate><description>&lt;p&gt;The validation procedure is described on page 8 of the TOPLOC paper: https://arxiv.org/abs/2501.16007 The checksum is validated by redoing the computation, but making use of the fact that you already have the entire response to enable greater parallelism than when generating it one token at a time.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2501.16007/"&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>
