How far is ZKP from compute verification in high-stakes environments?
Source ↗
👁 0
💬 0
A baseline overhead measurement and the hash-problemThis is an exploration into the current state of ZKP for LLM inference to use in a high-stakes environment like international agreements. It’s the first post in a current project I’m working on that will result in a paper that goes into all of the details of this question; “When does ZKP become more cost-effective than an auditing environment?” in this context. I got inspired after reading Naci Cankaya’s post here on LW and am motivated by a ge
Comments (0)